Manuel Blum. Recursive function theory and speed of computation. Canadian mathematical bulletin , vol. 9 , pp. 745–750

Journal of Symbolic Logic 37 (1):199 (1972)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272621

Links

PhilArchive



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

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: Manuel Blum, Recursive Function Theory and Speed of Computation. [REVIEW]Paul Young - 1972 - Journal of Symbolic Logic 37 (1):199-199.
A foundation for real recursive function theory.José Félix Costa, Bruno Loff & Jerzy Mycka - 2009 - Annals of Pure and Applied Logic 160 (3):255-288.
A Note on Relative Efficiency of Axiom Systems.Sandra Fontani, Franco Montagna & Andrea Sorbi - 1994 - Mathematical Logic Quarterly 40 (2):261-272.
Davis Martin. Applications of recursive function theory to number theory. Recursive function theory, Proceedings of symposia in pure mathematics, vol. 5, American Mathematical Society, Providence 1962, pp. 135–138. [REVIEW]Julia Robinson - 1972 - Journal of Symbolic Logic 37 (3):602-602.
Manuel Blum. A Machine-independent theory of the complexity of recursive functions. Journal of the Association for Computing Machinery, vol. 14 (1967), pp. 322–336. [REVIEW]Manuel Blum - 1970 - Journal of Symbolic Logic 34 (4):657-658.
Review: Manuel Blum, A Machine-Independent Theory of the Complexity of Recursive Functions. [REVIEW]Stephen A. Cook - 1969 - Journal of Symbolic Logic 34 (4):657-658.
Measure independent Gödel speed‐ups and the relative difficulty of recognizing sets.Martin K. Solomon - 1993 - Mathematical Logic Quarterly 39 (1):384-392.
Full Satisfaction Classes and Recursive Saturation.Alistair H. Lachlan - 1981 - Canadian Mathematical Bulletin 24 (1):295--97.
Sequential real number computation and recursive relations.J. Raymundo Marcial-Romero & M. Andrew Moshier - 2008 - Mathematical Logic Quarterly 54 (5):492-507.
On the Difficulty of Writing Out formal Proofs in Arithmetic.Ryo Kashima & Takeshi Yamaguchi - 1997 - Mathematical Logic Quarterly 43 (3):328-332.
Computability, an introduction to recursive function theory.Nigel Cutland - 1980 - New York: Cambridge University Press.
On mathematical instrumentalism.Patrick Caldon & Aleksandar Ignjatović - 2005 - Journal of Symbolic Logic 70 (3):778-794.
Characterizing the elementary recursive functions by a fragment of Gödel's T.Arnold Beckmann & Andreas Weiermann - 2000 - Archive for Mathematical Logic 39 (7):475-491.
Inductive inference and unsolvability.Leonard M. Adleman & M. Blum - 1991 - Journal of Symbolic Logic 56 (3):891-900.
On Mathematical Instrumentalism.Patrick Caldon & Aleksandar Ignjatović - 2005 - Journal of Symbolic Logic 70 (3):778 - 794.

Analytics

Added to PP
2016-06-30

Downloads
27 (#589,794)

6 months
4 (#790,347)

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