bokomslag Algorithms in Modern Mathematics and Computer Science
Data & IT

Algorithms in Modern Mathematics and Computer Science

A P Ershov Donald E Knuth

Pocket

529:-

Funktionen begränsas av dina webbläsarinställningar (t.ex. privat läge).

Uppskattad leveranstid 7-12 arbetsdagar

Fri frakt för medlemmar vid köp för minst 249:-

  • 490 sidor
  • 1981
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.

  • Författare: A P Ershov, Donald E Knuth
  • Illustratör: 1 farb Abb
  • Format: Pocket/Paperback
  • ISBN: 9783540111573
  • Språk: Engelska
  • Antal sidor: 490
  • Utgivningsdatum: 1981-11-01
  • Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. K