Review: A. N. Kolmogorov, V. A. Uspenskij, On the Definition of an Algorithm [Book Review]

Journal of Symbolic Logic 38 (4):655-655 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Review: V. A. Uspenskij, (Lekcii o vycislimyh funkciah)Lectures on Computable Functions. [REVIEW]Elliott Mendelson - 1966 - Journal of Symbolic Logic 31 (2):263-264.
Truth, proofs and functions.Jean Fichot - 2003 - Synthese 137 (1-2):43 - 58.
Can Machines Think? An Old Question Reformulated.Achim Hoffmann - 2010 - Minds and Machines 20 (2):203-212.
Recursive events in random sequences.George Davie - 2001 - Archive for Mathematical Logic 40 (8):629-638.
Turing test, easy to pass; human mind, hard to understand.Cristi Stoica - unknown
The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences.Wolfgang Merkle - 2003 - Journal of Symbolic Logic 68 (4):1362-1376.
Review: V. A. Uspenskij, On Calculable Operations. [REVIEW]Andrzej Mostowski - 1957 - Journal of Symbolic Logic 22 (1):76-77.
Review: V. A. Uspenskij, On Algorithmic Reducibility. [REVIEW]Andrzej Mostowski - 1958 - Journal of Symbolic Logic 23 (2):225-225.
Review: V. A. Uspenskij, On the Theorem on Uniform Continuity. [REVIEW]J. Onyszkiewicz - 1964 - Journal of Symbolic Logic 29 (1):62-63.
Enumerations of the Kolmogorov Function.Richard Beigel, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan & Leen Torenvliet - 2006 - Journal of Symbolic Logic 71 (2):501 - 528.
Review: V. A. Uspenskij, Theorem of Godel and Theory of Algorithms. [REVIEW]Andrzej Mostowski - 1954 - Journal of Symbolic Logic 19 (3):218-219.
Review: V. A. Uspenskij, Systems of Enumerable Sets and Their Enumerations. [REVIEW]Andrzej Ehrenfeucht - 1957 - Journal of Symbolic Logic 22 (2):220-220.
Review: V. A. Uspenskij, Some Notes on Recursively Enumerable Sets. [REVIEW]Andrzej Mostowski - 1958 - Journal of Symbolic Logic 23 (1):49-50.
Review: V. A. Uspenskij, Calculable Operations and the Notion of a Program. [REVIEW]Andrzej Mostowski - 1958 - Journal of Symbolic Logic 23 (1):49-49.
Towards a stable definition of algorithmic randomness.Hector Zenil - unknown

Analytics

Added to PP
2013-11-22

Downloads
11 (#1,075,532)

6 months
2 (#1,157,335)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Add more citations

References found in this work

No references found.

Add more references