Skip to main content Accessibility help
×
Home
Hostname: page-component-7f7b94f6bd-98q29 Total loading time: 0.173 Render date: 2022-06-29T17:51:19.048Z Has data issue: true Feature Flags: { "shouldUseShareProductTool": true, "shouldUseHypothesis": true, "isUnsiloEnabled": true, "useRatesEcommerce": false, "useNewApi": true } hasContentIssue true

Recursive Unsolvability of a problem of Thue

Published online by Cambridge University Press:  12 March 2014

Emil L. Post*
Affiliation:
The City College, College of The City of New York

Extract

Alonzo Church suggested to the writer that a certain problem of Thue [6] might be proved unsolvable by the methods of [5]. We proceed to prove the problem recursively unsolvable, that is, unsolvable in the sense of Church [1], but by a method meeting the special needs of the problem.

Thue's (general) problem is the following. Given a finite set of symbols α1, α2, …, αμ, we consider arbitrary strings (Zeichenreihen) on those symbols, that is, rows of symbols each of which is in the given set. Null strings are included.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1947

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.)

References

[1]Church, Alonzo, An unsolvable problem of elementary number theory, American journal of mathematics, vol. 58 (1936), pp. 345363.CrossRefGoogle Scholar
[2]Post, Emil L., Finite combinatory processes—formulation 1, this Journal, vol. 1 (1936), pp. 103105.Google Scholar
[3]Post, Emil L., Formal reductions of the general combinatorial decision problem, American journal of mathematics, vol. 65 (1943), pp. 197215.CrossRefGoogle Scholar
[4]Post, Emil L., Recursively enumerable sets of positive integers and their decision problems, Bulletin of the American Mathematical Society, vol. 50 (1944), pp. 284316.CrossRefGoogle Scholar
[5]Post, Emil L., A variant of a recursively unsolvable problem, Bulletin of the American Mathematical Society, vol. 52 (1946), pp. 264268.CrossRefGoogle Scholar
[6]Thue, Axel, Probleme über Veränderungen von Zeichenreihen nach gegebenen Regeln, Skrifter utgit av Videnskapsselskapet i Kristiania, I. Matematisk-naturvidenskabelig Klasse 1914, no. 10 (1914), 34 pp.Google Scholar
[7]Turing, A. M., On computable numbers, with an application to the Entscheidungsproblem, Proceedings of the London Mathematical Society, ser. 2 vol. 42 (1937), pp. 230265.CrossRefGoogle Scholar
[8]Turing, A. M., Computability and λ-definability, this Journal, vol. 2 (1937), pp. 153163.Google Scholar
273
Cited by

Save article to Kindle

To save this article to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

Recursive Unsolvability of a problem of Thue
Available formats
×

Save article to Dropbox

To save this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about saving content to Dropbox.

Recursive Unsolvability of a problem of Thue
Available formats
×

Save article to Google Drive

To save this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you used this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about saving content to Google Drive.

Recursive Unsolvability of a problem of Thue
Available formats
×
×

Reply to: Submit a response

Please enter your response.

Your details

Please enter a valid email address.

Conflicting interests

Do you have any conflicting interests? *