Universal turing machines: An exercise in coding

Mathematical Logic Quarterly 3 (6-10):69-80 (1957)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



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

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

Definability by turing machines.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (20-22):325-332.
Review: Hao Wang, A survey of Mathematical logic. [REVIEW]Steven Orey - 1963 - Journal of Symbolic Logic 28 (4):288-289.
Quantificational variants on the halting problem for turing machines.Patrick C. Fischer - 1969 - Mathematical Logic Quarterly 15 (13-15):211-218.

Analytics

Added to PP
2013-11-24

Downloads
52 (#418,263)

6 months
7 (#706,906)

Historical graph of downloads
How can I increase my downloads?