Algorithms in Modern Mathematics and Computer Science Proceedings, Urgench, Uzbek SSR September 16-22, 1979
Título:
Algorithms in Modern Mathematics and Computer Science Proceedings, Urgench, Uzbek SSR September 16-22, 1979
ISBN:
9783540386216
Edición:
1st ed. 1981.
PRODUCTION_INFO:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1981.
Descripción física:
XIV, 490 p. online resource.
Serie:
Lecture Notes in Computer Science, 122
Contenido:
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.
Autor corporativo añadido:
Acceso electrónico:
Full Text Available From Springer Nature Computer Science Archive Packages
Idioma:
Inglés