Algorithms in Modern Mathematics and Computer Science
Springer Berlin (Verlag)
978-3-540-11157-3 (ISBN)
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.
Erscheint lt. Verlag | 1.11.1981 |
---|---|
Reihe/Serie | Lecture Notes in Computer Science |
Zusatzinfo | XIV, 490 p. |
Verlagsort | Berlin |
Sprache | englisch |
Maße | 216 x 279 mm |
Gewicht | 846 g |
Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
Schlagworte | algorithm • Algorithm analysis and problem complexity • algorithms • Algorithmus • ants • Complexity • Hwarismi, Muhammad B. Musa al- • Mathematics |
ISBN-10 | 3-540-11157-3 / 3540111573 |
ISBN-13 | 978-3-540-11157-3 / 9783540111573 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich