Anbieter: ThriftBooks-Dallas, Dallas, TX, USA
Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
Sprache: Englisch
Verlag: New York/Berlin, Springer (Texts and Monographs in Computer Science), 1982
ISBN 10: 0387907432 ISBN 13: 9780387907437
Anbieter: Antiquariat Smock, Freiburg, Deutschland
Erstausgabe
Zustand: Sehr gut. Formateinband: illustrierter Pappband / gebundene Ausgabe VIII, 251 S. (24,5 cm) 1st Edition; Gut und sauber erhalten. Sprache: Englisch Gewicht in Gramm: 700 [Stichwörter: ].
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
EUR 23,92
Anzahl: 1 verfügbar
In den WarenkorbZustand: Fair. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In fair condition, suitable as a study copy. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,650grams, ISBN:0387907432.
Anbieter: Studibuch, Stuttgart, Deutschland
hardcover. Zustand: Befriedigend. 251 Seiten; 9783540907435.4 Gewicht in Gramm: 1.
Taschenbuch. Zustand: Neu. A Programming Approach to Computability | A. J. Kfoury (u. a.) | Taschenbuch | viii | Englisch | 2011 | Springer | EAN 9781461257516 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computability theory is at the heart of theoretical computer science. Yet, ironically, many of its basic results were discovered by mathematical logicians prior to the development of the first stored-program computer. As a result, many texts on computability theory strike today's computer science students as far removed from their concerns. To remedy this, we base our approach to computability on the language of while-programs, a lean subset of PASCAL, and postpone consideration of such classic models as Turing machines, string-rewriting systems, and p. -recursive functions till the final chapter. Moreover, we balance the presentation of un solvability results such as the unsolvability of the Halting Problem with a presentation of the positive results of modern programming methodology, including the use of proof rules, and the denotational semantics of programs. Computer science seeks to provide a scientific basis for the study of information processing, the solution of problems by algorithms, and the design and programming of computers. The last 40 years have seen increasing sophistication in the science, in the microelectronics which has made machines of staggering complexity economically feasible, in the advances in programming methodology which allow immense programs to be designed with increasing speed and reduced error, and in the develop ment of mathematical techniques to allow the rigorous specification of program, process, and machine.