Enumeration of Recursive Sets By Turing Machine

Mathematical Logic Quarterly 11 (3):197-201 (1965)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

reprint Blum, E. K. (1965) "Enumeration of Recursive Sets By Turing Machine". Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 11(3):197-201

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 106,951

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

On Recursive Enumeration Without Repetition.A. H. Lachlan - 1965 - Mathematical Logic Quarterly 11 (3):209-220.
On Recursive Enumeration Without Repetition: A Correction.A. H. Lachlan - 1967 - Mathematical Logic Quarterly 13 (7-12):99-100.
Some Special Pairs of Σ2 e-Degrees.Seema Ahmad & Alistair H. Lachlan - 1998 - Mathematical Logic Quarterly 44 (4):431-449.
On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
On MODkP Counting Degrees.Masamitsu Ozaki & Juichi Shinoda - 1999 - Mathematical Logic Quarterly 45 (3):327-342.
Enumeration of recursive sets.Yoshindo Suzuki - 1959 - Journal of Symbolic Logic 24 (4):311.

Analytics

Added to PP
2013-11-24

Downloads
22 (#1,082,780)

6 months
2 (#1,372,012)

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

Computability & unsolvability.Martin Davis - 1958 - New York: Dover Publications.
Enumeration of recursive sets.Yoshindo Suzuki - 1959 - Journal of Symbolic Logic 24 (4):311.

Add more references