Algorithms in Modern Mathematics and Computer Science

Lieferzeit: Lieferbar innerhalb 14 Tagen

37,44 

Proceedings, Urgench, Uzbek SSR September 16-22,1979, Lecture Notes in Computer Science 122

ISBN: 3540111573
ISBN 13: 9783540111573
Herausgeber: A P Ershov/D E Knuth
Verlag: Springer Verlag GmbH
Umfang: xiv, 490 S., 1 farbige Illustr.
Erscheinungsdatum: 01.11.1981
Produktform: Kartoniert
Einband: Kartoniert
Artikelnummer: 1458965 Kategorie:

Beschreibung

InhaltsangabeAl-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.

Herstellerkennzeichnung:


Springer Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

E-Mail: juergen.hartmann@springer.com

Das könnte Ihnen auch gefallen …