Absolutely unsolvable problems and supertask computers

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Moniri Morteza

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: MANTEQ-PAZHUHI (LOGICAL STUDIES) Year:2023 | Volume:14 | Issue:1 Page(s): 195-204

Download Full-Text

Persian Verion

View:

Download:

Cites:

Information Journal Paper

Title

Absolutely unsolvable problems and supertask computers

Author(s)

Moniri Morteza | Issue Writer Certificate

Keywords

Gödel

absolutely unsolvable problems

supertask computer

infinite Turing machine

infinite rule

Abstract

First, in the light of Feferman’s views, we will examine Gödel’s dichotomy that either the capabilities of the human mind are beyond any finite machine, or there are Diophantine-type mathematical equations that are absolutely unsolvable. Then we examine Putnam’s argument that if scientific competence of the mind can be simulated by a Turing machine with the ability to prepare a list of scientific propositions, this machine will not print out the sentence that expresses this ability. In an effort to better understand this proof, we restate it in the language of modal logic. Then, we discuss the possibility of supertask computations to perform infinite basic operations in finite time. This is a possibility that has recently been proposed based on new physical theories. We argue that, assuming that such a possibility is realized, arithmetic will be determinate, meaning that the truth or falsity of each arithmetic sentence will be explainable.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans