The Church-Turing thesis and its look-alikes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The Church-Turing thesis and its look-alikes

Full text

Pdf (449 KB)

Source

ACM SIGACT News archive
Volume 36 , Issue 3 (September 2005) table of contents

Pages: 113 - 114

Year of Publication: 2005

ISSN:0163-5700

Author

Amir M. Ben-Amram

The Academic College of Tel-Aviv Yaffo, Tel Aviv, Israel

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 5, Downloads (12 Months): 29, Citation Count: 0

Additional Information:

abstract references index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/1086649.1086651 What is a DOI?

ABSTRACT

"A function is mechanically computable (that is: computable by means of a machine) if and only if it is Turing-computable."

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

Turing, Alan M. On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2, 42, 230--265, 1936. Corrections ibid. 544--546 (1937).

INDEX TERMS

Primary Classification:
F. Theory of Computation
F.3 LOGICS AND MEANINGS OF PROGRAMS
F.3.3 Studies of Program Constructs
Subjects: Type structure