Review: Tibor Rado, On a Simple Source for Non-Computable Functions [Book Review]

Journal of Symbolic Logic 32 (4):524-524 (1967)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 90,593

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Review: T. Rado, On Non-Computable Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Uncomputably Noisy Ergodic Limits.Jeremy Avigad - 2012 - Notre Dame Journal of Formal Logic 53 (3):347-350.
Bounded iteration and unary functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
Order-Computable Sets.Denis Hirschfeldt, Russell Miller & Sergei Podzorov - 2007 - Notre Dame Journal of Formal Logic 48 (3):317-347.
Note on an inequality of Tibor Rado.Michael Anderson - 1967 - Notre Dame Journal of Formal Logic 8 (1-2):159-160.
On a hitherto unexploited extension of the finitary standpoint.Kurt Gödel - 1980 - Journal of Philosophical Logic 9 (2):133 - 142.
Computability of measurable sets via effective topologies.Yongcheng Wu & Decheng Ding - 2006 - Archive for Mathematical Logic 45 (3):365-379.

Analytics

Added to PP
2013-11-22

Downloads
1 (#1,769,934)

6 months
1 (#1,040,386)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references