On the definition of an algorithm

DOI10.1090/TRANS2/029/07MaRDI QIDQ5335314zbMATH OpenOpenAlexFDO

Authors V. A. Uspenskiĭ, A. N. Kolmogorov

Publication date 1963

Published in American Mathematical Society Translations: Series 2 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1090/trans2/029/07

zbMATH Keywords

mathematical logic

Cited in

(10)

• Space measures for storage modification machines
• Conceptual Confluence in 1936: Post and Turing
• Theses for computation and recursion on concrete and abstract structures
• The complexity of error-correcting codes
• Vladimir Andreevich Uspensky (27/11/1930–27/6/2018)
• The developments of the concept of machine computability from 1936 to the 1960s
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Time and space measures for a complete graph computation model
• Theoretical computer science: computability, decidability and logic
• The 1982 ACM Turing Award lecture. An overview of computational complexity

This page was built for publication: On the definition of an algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5335314)