Skip to main content
SpringerLink
Log in

Some post canonical systems in one letter

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Post's Canonical systems in one letter are viewed as operations on natural numbers. It is shown that, in a certain sense, these systems are capable of producing arbitrary recursively enumerable sets. Also, certain special cases are examined.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Post,Formal Reductions of the General Combinatorial Decision Problem, Amer. J. Math. Vol. 65 (1943), 197–215.

    Google Scholar 

  2. J. C. Shepherdson and H. E. Sturgis,Computability of Recursive Functions, JACM Vol. 10 (1963), 217–255.

    Google Scholar 

  3. R. Smullyan,Extended Canonical Systems, Proc. Amer. Math, Soc., June, (1961), 440–442.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Pennsylvania State University, 16802, University Park, PA, USA

    W. H. Hosken

Authors
  1. W. H. Hosken
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hosken, W.H. Some post canonical systems in one letter. BIT 12, 509–515 (1972). https://doi.org/10.1007/BF01932960

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01932960

Keywords

Search

Navigation