Hostname: page-component-7dd5485656-bt4hw Total loading time: 0 Render date: 2025-10-27T22:00:30.282Z Has data issue: false hasContentIssue false
  • English
  • Français

Marvin L. Minsky. Recursive unsolvability of Post's problem of “Tag” and other topics in the theory of Turing machines. Annals of mathematics, second series, vol. 74 (1961), pp. 437–455.

Review products

Marvin L. Minsky. Recursive unsolvability of Post's problem of “Tag” and other topics in the theory of Turing machines. Annals of mathematics, second series, vol. 74 (1961), pp. 437–455.

Published online by Cambridge University Press:  12 March 2014

Martin Davis
Get access Rights & Permissions [Opens in a new window]

Abstract

An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'

Information

Type
Reviews
Information
The Journal of Symbolic Logic , Volume 31 , Issue 4 , December 1966 , pp. 654 - 655
Copyright
Copyright © Association for Symbolic Logic 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable