Algorithms in Modern Mathematics and Computer Science: Proceedings, Urgench, Uzbek SSR September 16–22, 1979

Al-khorezmi his background, his personality his work and his influence....Pages 1-81
Algorithms in modern mathematics and computer science....Pages 82-99
What are the gains of the theory of algorithms....Pages 100-234
On inductive synthesis of programs....Pages 235-254
Expanding constructive universes....Pages 255-260
The logical approach to programming....Pages 261-289
The structural synthesis of programs....Pages 290-303
On finding invariant relations of program....Pages 304-314
What can we do with problems of exhaustive search?....Pages 315-342
The algorithmic complexity of linear algebras....Pages 343-354
Algorithms in various contexts....Pages 355-360
Role of a notion of algorithm in the arithmetic language semantics....Pages 361-389
From logicism to proceduralism (an autobiographical account)....Pages 390-396
Abstract computability on algebraic structures....Pages 397-420
Algorithms and algebra....Pages 421-429
On formal transformations of algorithms....Pages 430-440
What should we do having proved a decision problem to be unsolvable?....Pages 441-443
On the experience of riding two horses in programming....Pages 444-448
Church-rosser transformers and decidable propertis of tree processing....Pages 449-457
Supplement 1 summaries of oral presentations....Pages 458-465
Supplement 2 technical program....Pages 466-469
Supplement 3 publications on the symposium....Pages 470-473
List of participants....Pages 474-476
Supplement 5 photoillustrations....Pages 477-487