Algorithms in Modern Mathematics and Computer Science

ERSHOV, Andrei P. / KNUTH, Donald E. (ed)

ISBN 10: 3540111573 / ISBN 13: 9783540111573

Editore: Springer-Verlag, Berlin, 1981

Riguardo questo articolo

xi + 487 p; many Ill. [LECTURE NOTES IN COMPUTER SCIENCE ; 122].

Codice articolo 012980-122

Dati bibliografici

• Titolo: Algorithms in Modern Mathematics and Computer Science
• Editore: Springer-Verlag, Berlin
• Data di pubblicazione: 1981
• Lingua: Inglese
• ISBN 10: 3540111573
• ISBN 13: 9783540111573
• Rilegatura: Softcover
• Edizione: 1st Edition.
• Condizione: Good
• Tipo di libro: Buch
• Cataloghi dei venditori:
  • Informatik / Computer Science

Descrizione articolo

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.