Algorithms in Modern Mathematics and Computer Science

Proceedings, Urgench, Uzbek SSR September 16-22, 1979

504 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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.

• Reihe: Lecture Notes in Computer Science
• Themen: Informatik und Informationstechnologie Computerprogrammierung und Softwareentwicklung Algorithmen und Datenstrukturen
• ISBN: 9783540111573
• Sprache: Englisch
• Erscheinungsdatum: 01.11.1981
• Größe: 279 x 210 mm
• Verlag: Springer
• Herausgegeben von: A. P. Ershov, D. E. Knuth