Algorithms in Modern Mathematics and Computer Science
Proceedings, Urgench, Uzbek SSR September 16-22, 1979
(Sprache: Englisch)
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...
Leider schon ausverkauft
versandkostenfrei
Buch
38.49 €
- Lastschrift, Kreditkarte, Paypal, Rechnung
- Kostenlose Rücksendung
Produktdetails
Produktinformationen zu „Algorithms in Modern Mathematics and Computer Science “
Klappentext zu „Algorithms in Modern Mathematics and Computer Science “
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.
Inhaltsverzeichnis zu „Algorithms in Modern Mathematics and Computer Science “
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.
Bibliographische Angaben
- 1981, 504 Seiten, Maße: 21 x 27,9 cm, Kartoniert (TB), Englisch
- Herausgegeben: D. E. Knuth, A. P. Ershov
- Verlag: Springer Berlin Heidelberg
- ISBN-10: 3540111573
- ISBN-13: 9783540111573
- Erscheinungsdatum: 01.11.1981
Sprache:
Englisch
Kommentar zu "Algorithms in Modern Mathematics and Computer Science"
Schreiben Sie einen Kommentar zu "Algorithms in Modern Mathematics and Computer Science".
Kommentar verfassen