Algorithms in Modern Mathematics and Computer Science: Proceedings, Urgench, Uzbek SSR September 16-22, 1979 (Lecture Notes in Computer Science): 122 - Brossura

Brossura

ISBN 10: 3540111573 ISBN 13: 9783540111573

Casa editrice: Springer, 1981

Su questo libro

Contenuti

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.

Dettagli dell'edizione

• Editore: Springer
• Data di pubblicazione: 1981
• Lingua: Inglese
• ISBN 10: 3540111573
• ISBN 13: 9783540111573
• Rilegatura: Copertina flessibile
• Numero di pagine: 504
• Redattore: Ershov A. P.
• Contatto del produttore: non disponibile
• Persona responsabile: CMN Printpool Inh. Mathis Neumann; https://www.also.com/ec/cms5/en_6000/6000/index.jsp; ; Friedrich-Karl-Str. 9; Hamburg; Germania