Rado T.. On non-computable functions. The Bell System technical journal, vol. 41 , pp. 877–884

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2270192

Links

PhilArchive



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

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: T. Rado, On Non-Computable Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.
Review: Tibor Rado, On a Simple Source for Non-Computable Functions. [REVIEW]F. B. Cannonito - 1967 - Journal of Symbolic Logic 32 (4):524-524.
McCluskey E. J. Jr. Minimization of Boolean functions. The Bell System technical journal, vol. 35 , pp. 1417–1444.Robert McNaughton - 1958 - Journal of Symbolic Logic 23 (2):235-235.
Rado Tibor. On a simple source for non-computable functions. Proceedings of the Symposium on Mathematical Theory of Automata, New York, N.Y., April 24, 25, 26, 1962, Microwave Research Institute symposia series vol. 12, Polytechnic Press of the Polytechnic Institute of Brooklyn, Brooklyn, N.Y., 1963, pp. 75–81. [REVIEW]F. B. Cannonito - 1968 - Journal of Symbolic Logic 32 (4):524-524.
Semon Warren. Synthesis of series-parallel network switching functions. The Bell System technical journal, vol. 37 , pp. 877–898. [REVIEW]Thomas H. Mott - 1960 - Journal of Symbolic Logic 25 (2):188-188.
Derivatives of Computable Functions.Ning Zhong - 1998 - Mathematical Logic Quarterly 44 (3):304-316.
On the convergence of Fourier series of computable Lebesgue integrable functions.Philippe Moser - 2010 - Mathematical Logic Quarterly 56 (5):461-469.
Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
H‐monotonically computable real numbers.Xizhong Zheng, Robert Rettinger & George Barmpalias - 2005 - Mathematical Logic Quarterly 51 (2):157-170.
Slepian David. On the number of symmetry types of Boolean functions of n variables. Canadian journal of mathematics, vol 5 , pp. 135–193. Reprinted in the Bell Telephone System technical publications, monograph 2154. [REVIEW]Raymond J. Nelson - 1955 - Journal of Symbolic Logic 20 (1):70-70.
When series of computable functions with varying domains are computable.Iraj Kalantari & Larry Welch - 2013 - Mathematical Logic Quarterly 59 (6):471-493.
Lp -Computability.Ning Zhong & Bing-Yu Zhang - 1999 - Mathematical Logic Quarterly 45 (4):449-456.
Bounded iteration and unary functions.Stefano Mazzanti - 2005 - Mathematical Logic Quarterly 51 (1):89-94.
A Banach–Mazur computable but not Markov computable function on the computable real numbers.Peter Hertling - 2005 - Annals of Pure and Applied Logic 132 (2-3):227-246.
Formulas for Computable and Non-Computable Functions.Samuel Alexander - 2006 - Rose-Hulman Undergraduate Mathematics Journal 7 (2).

Analytics

Added to PP
2016-06-30

Downloads
20 (#744,405)

6 months
12 (#203,353)

Historical graph of downloads
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