Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the definition of an algorithm

From MaRDI portal
Publication:5335314
Jump to:navigation, search

DOI10.1090/trans2/029/07zbMath0128.01302OpenAlexW4254565345MaRDI QIDQ5335314

A. N. Kolmogorov, Vladimir A. Uspensky

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



Related Items

The complexity of error-correcting codes, Space measures for storage modification machines, A class of algorithms which require nonlinear time to maintain disjoint sets, Unnamed Item, Conceptual Confluence in 1936: Post and Turing, Theses for Computation and Recursion on Concrete and Abstract Structures, Vladimir Andreevich Uspensky (27/11/1930–27/6/2018), The Developments of the Concept of Machine Computability from 1936 to the 1960s



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5335314&oldid=20025705"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 9 February 2024, at 00:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki