Honest Bounds for complexity classes of recursive functions

&
Journal of Symbolic Logic 39 (1):127-138 (1974)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2272353

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,130

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

Martin R. M.. A note on nominalism and recursive functions.John Myhill - 1950 - Journal of Symbolic Logic 15 (2):153-153.
Some Classes of Recursive Functions.Andrzej Grzegorczyk - 1955 - Journal of Symbolic Logic 20 (1):71-72.
Shoenfield J. R.. The class of recursive functions. Proceedings of the American Mathematical Society, vol. 9 , pp. 690–692. [REVIEW]Paul Axt - 1959 - Journal of Symbolic Logic 24 (3):238-239.
Classes of Recursive Functions based on Ackermann's Function.Robert W. Ritchie - 1966 - Journal of Symbolic Logic 31 (4):654-654.
Anna R. Bruss and Albert R. Meyer. On time-space classes and their relation to the theory of real addition. Theoretical computer science, vol. 11 , pp. 59–69. - Leonard Berman. The complexity of logical theories. Theoretical computer science, pp. 71–77. - Hugo Volger. Turing machines with linear alternation, theories of bounded concatenation and the decision problem of first order theories. Theoretical computer science, vol. 23 , pp. 333–337. [REVIEW]Charles Rackoff - 1986 - Journal of Symbolic Logic 51 (3):817-818.
Logics which capture complexity classes over the reals.Felipe Cucker & Klaus Meer - 1999 - Journal of Symbolic Logic 64 (1):363-390.
A Δ02 theory of regressive isols.Erik Ellentuck - 1974 - Journal of Symbolic Logic 39 (3):459 - 468.
The $\mu$ -measure as a tool for classifying computational complexity.Karl-Heinz Niggl - 2000 - Archive for Mathematical Logic 39 (7):515-539.

Analytics

Added to PP
2009-01-28

Downloads
41 (#544,062)

6 months
14 (#224,604)

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

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
Complexity of Algorithms and Computations.B. A. Trahtenbrot - 1970 - Journal of Symbolic Logic 35 (2):337-339.

Add more references