Algorithms in Modern Mathematics and Computer Science: Proceedings, Urgench, Uzbek SSR, September 16-22, 1979 |
Contents
H Zemanek DIXIT ALGORIZMI His Background | 1 |
E Knuth Algorithms in modern mathematics and | 82 |
A Uspensky What are the gains of the theory of | 100 |
Copyright | |
15 other sections not shown
Other editions - View all
Algorithms in Modern Mathematics and Computer Science A. P. Ershov,D. E. Knuth No preview available - 2014 |
Algorithms in Modern Mathematics and Computer Science: Proceedings, Urgench ... A. P. Ershov,D. E. Knuth No preview available - 1981 |
Common terms and phrases
abstract al-Khorezmi al-Khwarizmi al-Mamun algebra alphabet Arabic arbitrary arithmetic axioms bounds calculus caliph called complexity computable function computable operation computational model computer science concept of algorithm consider constructive objects corresponding decidable decision problem defined definition denote DIXIT ALGORIZMI DO-statement elements entropy enumerable set equations equivalent example exists finite formal formula given Gödel graph House of Wisdom inductive description input integer isomorphic Khorezm Khorezmians Kleene Kolmogorov complex Kolmogorov entropy Kolmogorov machines logic mapping mass problem mathematicians mathematics means method metric space Moschovakis natural numbers notion obtained polynomial predicate proof proved random real number recursion theory recursive functions reducibility relation result scientists semantics sequence solution solvable solving statement structure subset synthesis theorem theory of algorithms tion topological space transformations translation Turing machines unsolvable values variables word вып ДАН Ершов кн Марков А.А Наука СССР Теория