Giorgio Ausiello. Abstract computational complexity and cycling computations. Journal of computer and system sciences, vol. 5 , pp. 118–128 [Book Review]

Journal of Symbolic Logic 40 (2):248 (1975)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.2307/2271926

Other Versions

No versions found

Links

PhilArchive



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

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

Abstract Computational Complexity and Cycling Computations.Giorgio Ausiello - 1975 - Journal of Symbolic Logic 40 (2):248-248.
Lewis F. D.. The enumerability and invariance of complexity classes. Journal of computer and system sciences, vol. 5 , pp. 286–303. [REVIEW]Nancy A. Lynch - 1974 - Journal of Symbolic Logic 39 (2):349-349.
Ibarra Oscar H.. Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata. Journal of computer and system sciences, vol. 5 , pp. 88-117. [REVIEW]Walter J. Savitch - 1974 - Journal of Symbolic Logic 39 (1):188-189.
Erwin Engeler. Algorithmic approximations. Journal of computer and system sciences, vol. 5 , pp. 67–82.R. M. Burstall - 1974 - Journal of Symbolic Logic 39 (2):348.
Zohar Manna. Mathematical theory of partial correctness. Journal of computer and system sciences, vol. 5 , pp. 239–253.Andrzej Blikle - 1974 - Journal of Symbolic Logic 39 (2):348.
Computational complexity theory, edited by Juris Hartmanis, Proceedings of symposia in applied mathematics, vol. 38, American Mathematical Society, Providence1989, ix + 128 pp. [REVIEW]Uwe Schoning - 1991 - Journal of Symbolic Logic 56 (1):335-336.
Abbott Wilton R.. Computing logical truth with the California Digital Computer. Mathematical tables and other aids to computation, vol. 5 , pp. 120–128. [REVIEW]George W. Patterson - 1952 - Journal of Symbolic Logic 17 (4):280-281.
Cleave John. The primitive recursive analysis of ordinary differential equations and the complexity of their solutions. Journal of computer and system sciences, vol. 3 , pp. 447–455. [REVIEW]Webb Miller - 1974 - Journal of Symbolic Logic 39 (2):345-346.
Hartmanis J. and Lewis F. D.. The use of lists in the study of undecidable problems in automata theory. Journal of computer and system sciences, vol. 5 , pp. 54–66. [REVIEW]Dennis F. Cudia - 1974 - Journal of Symbolic Logic 39 (2):347-347.
Neil Immerman. Upper and lower bounds for first order expressibility. Journal of computer and system sciences, vol. 25 , pp. 76–98. - Neil Immerman. Relational queries computable in polynomial time. Information and control, vol. 68 , pp. 86–104. - Neil Immerman. Languages that capture complexity classes. SIAM journal on computing, vol. 16 , pp. 760–778. [REVIEW]Samuel Buss - 1989 - Journal of Symbolic Logic 54 (1):287-288.

Analytics

Added to PP
2013-11-03

Downloads
32 (#710,849)

6 months
16 (#192,315)

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