Ershov, A. P. (ed.); Knuth, D. E. (ed.) [Zemanek, H.; Knuth, D. E.; Uspensky, V. A.; Semenov, A. L.; Barzdin, J. M.; Manin, Yu. I.; Nepeivoda, N. N.; Tyugu, E. H.; Letichevsky, A. A.; Adel’son-Vel’skii, G. M.; Slisenko, A. O.; Alder, A.; Strassen, V.; Kleene, S. C.; Shanin, N. A.; Tseytlin, G. S.; Ershov, A. P.; Bauer, F. L.; Glushkov, V. M.; Matijasevic, Y.; Matiyasevich, Yu. V.; Buda, A.; Anisimov, A. V.] Algorithms in modern mathematics and computer science. Proceedings, Urgench, Uzbek SSR, September 16–22, 1979. (English) Zbl 0477.68035 Lecture Notes in Computer Science, 122. Berlin-Heidelberg-New York: Springer-Verlag. XI, 487 p. DM 45.50; $ 21.20 (1981). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 19 ReviewsCited in 1 Document MSC: 68W99 Algorithms in computer science 68-06 Proceedings, conferences, collections, etc. pertaining to computer science 01A30 History of mathematics in the Golden Age of Islam 03-06 Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations 68Q25 Analysis of algorithms and problem complexity 03D60 Computability and recursion theory on ordinals, admissible sets, etc. 03B25 Decidability of theories and sets of sentences 03D25 Recursively (computably) enumerable sets and degrees 11U05 Decidability (number-theoretic aspects) 68N01 General topics in the theory of software 03F60 Constructive and recursive analysis 03F65 Other constructive mathematics 94A15 Information theory (general) 68P10 Searching and sorting 03A05 Philosophical and critical aspects of logic and foundations 03D40 Word problems, etc. in computability and recursion theory 03D15 Complexity of computation (including implicit computational complexity) 68Q60 Specification and verification (program logics, model checking, etc.) Keywords:Algorithms; Computer science; Proceedings; Urgench/UzSSR; general and applied theory of algorithms; computation theory; inductive and structural synthesis of programs; logical approach to programming; invariant relations of programs; exhaustive search; algorithmic complexity of linear algebras; languages of arithmetic; computability on algebraic structures; algorithms and algebra; formal transformations of algorithms PDFBibTeX XML