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)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

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

Universal turing machines: An exercise in coding.Hao Wang - 1957 - Mathematical Logic Quarterly 3 (6‐10):69-80.
Definability by turing machines.R. M. Baer - 1969 - Mathematical Logic Quarterly 15 (20‐22):325-332.
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.
Review: Wang Hao, Popular Lectures on Mathematical Logic. [REVIEW]H. Hermes - 1982 - Journal of Symbolic Logic 47 (4):908-909.

Analytics

Added to PP
2016-02-04

Downloads
27 (#578,242)

6 months
1 (#1,723,047)

Historical graph of downloads
How can I increase my downloads?