algorithms modern mathematics computer science de ershov knuth (15 resultados)

Condición: gut. XI, 487 S , Abb., 25 cm, Einband leicht fleckig und berieben, Titelblatt mit Bleistiftmarkierung. Proceedings, Urgench, Uzbek SSR, Sept. 16 - 22, 1979. Sprache: Englisch.

Paperback. Condición: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.

Softcover. Condición: As New. Leichte Abnutzungen.

Paperback. Condición: New.

Softcover. Condición: Good. 1st Edition. xi + 487 p; many Ill. [LECTURE NOTES IN COMPUTER SCIENCE ; 122]. Buch.

Softcover Sehr gut erhalten.

Condición: Good. Proceedings Uzbek SSR, sept 1979. Lecture notes in Computer Science 122. Goos & Hartmans eds. Paperback, 487pp. VG condition.

Soft cover. Condición: New. PHOTO AND VIDEO OF PAGES TAKEN TO SHOW CONDITION PRIOR TO SHIPPING; . PHOTOS EMAILED FOR MORE SPECIFICS WHEN REQUESTED; Book. Book.

Paperback. Condición: Brand New. 1st edition. 487 pages. 7.80x5.12x1.00 inches. In Stock.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Al-khorezmi his background, his personality his work and his influence.- Algorithms in modern mathematics and computer science.- What are the gains of the theory of algorithms.- On inductive synthesis of programs.- Expanding constructive universes.- The logical approach to programming.- The structural synthesis of programs.- On finding invariant relations of program.- What can we do with problems of exhaustive search .- The algorithmic complexity of linear algebras.- Algorithms in various contexts.- Role of a notion of algorithm in the arithmetic language semantics.- From logicism to proceduralism (an autobiographical account).- Abstract computability on algebraic structures.- Algorithms and algebra.- On formal transformations of algorithms.- What should we do having proved a decision problem to be unsolvable .- On the experience of riding two horses in programming.- Church-rosser transformers and decidable propertis of tree processing.- Supplement 1 summaries of oral presentations.- Supplement 2 technical program.- Supplement 3 publications on the symposium.- List of participants.- Supplement 5 photoillustrations.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Al-khorezmi his background, his personality his work and his influence.- Algorithms in modern mathematics and computer science.- What are the gains of the theory of algorithms.- On inductive synthesis of programs.- Expanding constructive universes.- The logical approach to programming.- The structural synthesis of programs.- On finding invariant relations of program.- What can we do with problems of exhaustive search .- The algorithmic complexity of linear algebras.- Algorithms in various contexts.- Role of a notion of algorithm in the arithmetic language semantics.- From logicism to proceduralism (an autobiographical account).- Abstract computability on algebraic structures.- Algorithms and algebra.- On formal transformations of algorithms.- What should we do having proved a decision problem to be unsolvable .- On the experience of riding two horses in programming.- Church-rosser transformers and decidable propertis of tree processing.- Supplement 1 summaries of oral presentations.- Supplement 2 technical program.- Supplement 3 publications on the symposium.- List of participants.- Supplement 5 photoillustrations. 504 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Al-khorezmi his background, his personality his work and his influence.- Algorithms in modern mathematics and computer science.- What are the gains of the theory of algorithms.- On inductive synthesis of programs.- Expanding constructive universes.- The log.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Al-khorezmi his background, his personality his work and his influence.- Algorithms in modern mathematics and computer science.- What are the gains of the theory of algorithms.- On inductive synthesis of programs.- Expanding constructive universes.- The logical approach to programming.- The structural synthesis of programs.- On finding invariant relations of program.- What can we do with problems of exhaustive search .- The algorithmic complexity of linear algebras.- Algorithms in various contexts.- Role of a notion of algorithm in the arithmetic language semantics.- From logicism to proceduralism (an autobiographical account).- Abstract computability on algebraic structures.- Algorithms and algebra.- On formal transformations of algorithms.- What should we do having proved a decision problem to be unsolvable .- On the experience of riding two horses in programming.- Church-rosser transformers and decidable propertis of tree processing.- Supplement 1 summaries of oral presentations.- Supplement 2 technical program.- Supplement 3 publications on the symposium.- List of participants.- Supplement 5 photoillustrations.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 504 pp. Englisch.

Taschenbuch. Condición: Neu. Algorithms in Modern Mathematics and Computer Science | Proceedings, Urgench, Uzbek SSR September 16-22, 1979 | A. P. Ershov (u. a.) | Taschenbuch | xiv | Englisch | 1981 | Springer | EAN 9783540111573 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.

Condición: New. PRINT ON DEMAND pp. 504.