Nepomniaschy V a (13 results)

Condition: Good. Taping to the spine of the book. Corners are taped also. Inscription to the inside cover. Taping to the cover/page binding also. Fine to read.

407 pages Ex-Library book in acceptable condition. Script without markings, cover damaged. 9783540067207 Sprache: Englisch Gewicht in Gramm: 880.

Broschiert. Condition: Gut. 407 Seiten; Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sauber. Es befindet sich neben dem Rückenschild lediglich ein Bibliotheksstempel im Buch; ordnungsgemäß entwidmet. Einbandkanten sind leicht bestoßen. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 660.

Broschiert. Condition: Gut. 407 Seiten Das hier angebotene Buch stammt aus einer teilaufgelösten wissenschaftlichen Bibliothek und trägt die entsprechenden Kennzeichnungen (Rückenschild, Instituts-Stempel.); leichte altersbedingte Anbräunung des Papiers; der Buchzustand ist ansonsten ordentlich und dem Alter entsprechend gut. In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 665.

Condition: New. In.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - An axiomatic definition of the programming language PASCAL.- The logic of 'can do'.- Copying in commutation ¿ Operator schemata.- On synthesizing programs given by examples.- Central technical issues in programming language design.- Sur quelques syst¿s de programmation pour les recherches scientifiques.- Decision problems in computational models.- Non-determined algorithm schemata or R-schemata.- Equivalence and optimization of programs.- On the average speed of automaton with terminal state.- Logical-termal equivalence of program schemata.- On universal classes of program schemas.- Certain decompositions of G¿del numbering and the semantics of programming languages.- Criteria for the algorithmic completeness of the systems of operations.- Data flow schemas.- Operation patterns.- Looking for an approach to a theory of models for parallel computation.- Configurable computers: A new class of general purpose machines.- A method for determining program data relationships.- Towards automatical construction of parallel programs.- A calculus for the mathematical theory of computation.- Admissibility of fixed-point induction in first-order logic of typed theories.- A formal approximation theory of semantic data types.- Some features of a language for a proof-checking programming system.

Paperback. Condition: Good. Lecture Notes In Computer Science, 5; 6.1 X 0.96 X 9.25 inches; 407 pages; Ex-Library copy with usual identifiers. Light wear on cover edges and on the head of the spine. Minor fading and rubbing on the covers. Good condition otherwise. No other noteworthy defects. No markings on text pages. ; - Your satisfaction is our priority. We offer free returns and respond promptly to all inquiries. Your item will be carefully cushioned in bubble wrap and securely boxed. All orders ship on the same or next business day. Buy with confidence. 1st Edition (Unstated); No Printing Stated.

Condition: New.

Taschenbuch. Condition: Neu. Neuware -An axiomatic definition of the programming language PASCAL.- The logic of 'can do'.- Copying in commutation ¿ Operator schemata.- On synthesizing programs given by examples.- Central technical issues in programming language design.- Sur quelques syst¿s de programmation pour les recherches scientifiques.- Decision problems in computational models.- Non-determined algorithm schemata or R-schemata.- Equivalence and optimization of programs.- On the average speed of automaton with terminal state.- Logical-termal equivalence of program schemata.- On universal classes of program schemas.- Certain decompositions of G¿del numbering and the semantics of programming languages.- Criteria for the algorithmic completeness of the systems of operations.- Data flow schemas.- Operation patterns.- Looking for an approach to a theory of models for parallel computation.- Configurable computers: A new class of general purpose machines.- A method for determining program data relationships.- Towards automatical construction of parallel programs.- A calculus for the mathematical theory of computation.- Admissibility of fixed-point induction in first-order logic of typed theories.- A formal approximation theory of semantic data types.- Some features of a language for a proof-checking programming system.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 420 pp. Englisch.

Paperback. Condition: Very Good. Very Good. book.

Paperback. Condition: Very Good. 0387067205 Ex-library paperback in very nice condition with the usual markings and attachments.

Condition: New.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -An axiomatic definition of the programming language PASCAL.- The logic of 'can do'.- Copying in commutation ¿ Operator schemata.- On synthesizing programs given by examples.- Central technical issues in programming language design.- Sur quelques syst¿s de programmation pour les recherches scientifiques.- Decision problems in computational models.- Non-determined algorithm schemata or R-schemata.- Equivalence and optimization of programs.- On the average speed of automaton with terminal state.- Logical-termal equivalence of program schemata.- On universal classes of program schemas.- Certain decompositions of G¿del numbering and the semantics of programming languages.- Criteria for the algorithmic completeness of the systems of operations.- Data flow schemas.- Operation patterns.- Looking for an approach to a theory of models for parallel computation.- Configurable computers: A new class of general purpose machines.- A method for determining program data relationships.- Towards automatical construction of parallel programs.- A calculus for the mathematical theory of computation.- Admissibility of fixed-point induction in first-order logic of typed theories.- A formal approximation theory of semantic data types.- Some features of a language for a proof-checking programming system. 420 pp. Englisch, Französisch.