DECIDABILITY OF INTELLIGENT SYSTEMS

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.

ALI HODJATI SEYYED MOHAMMAD; MEZGINEZHAD MORTEZA

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

Journal Paper

Paper Information

Journal: Wisdom and Philosophy Year:2008 | Volume:4 | Issue:1 (13) Page(s): 29-49

Download Full-Text

Persian Verion

View:

1,078

Download:

Cites:

Information Journal Paper

Title

DECIDABILITY OF INTELLIGENT SYSTEMS

Author(s)

ALI HODJATI SEYYED MOHAMMAD | MEZGINEZHAD MORTEZA | Issue Writer Certificate

Keywords

INTELLIGENT SYSTEMQ3

HALTING PROBLEMQ3

TOURING MACHINEQ3

UNDECIDABILITYQ2

PREDICATE LOGICQ3

Abstract

INTELLIGENT SYSTEMs are designed on the model of the operation of mind,but they come across, at least, the following problems:(a) Can IS solve every problem.(b) Is there any correspondence between the above problem and the UNDECIDABILITY of the first order PREDICATE LOGIC.Before finding proper answers, we should know the characteristics of an INTELLIGENT SYSTEM and how it solves a problem and what do we mean by its decidability.In this article we have dealt with the above issues and will show that an INTELLIGENT SYSTEM is a kind of algorithmic system and since we can find a problem (halting problem) which is unalgorithmic, that system cannot solve it; this means that an INTELLIGENT SYSTEM cannot solve all the problems and hence is undecidable. This UNDECIDABILITY, in turn, shows that the logic (i.e. first order PREDICATE LOGIC) which governs the system is also undecidable.

Cites

No record.

References

No record.

Cite

APA: Copy

ALI HODJATI, SEYYED MOHAMMAD, & MEZGINEZHAD, MORTEZA. (2008). DECIDABILITY OF INTELLIGENT SYSTEMS. HEKMAT VA FALSAFEH (WISDOM AND PHILOSOPHY), 4(1 (13)), 29-49. SID. https://sid.ir/paper/123404/en

Vancouver: Copy

ALI HODJATI SEYYED MOHAMMAD, MEZGINEZHAD MORTEZA. DECIDABILITY OF INTELLIGENT SYSTEMS. HEKMAT VA FALSAFEH (WISDOM AND PHILOSOPHY)[Internet]. 2008;4(1 (13)):29-49. Available from: https://sid.ir/paper/123404/en

IEEE: Copy

SEYYED MOHAMMAD ALI HODJATI, and MORTEZA MEZGINEZHAD, “DECIDABILITY OF INTELLIGENT SYSTEMS,” HEKMAT VA FALSAFEH (WISDOM AND PHILOSOPHY), vol. 4, no. 1 (13), pp. 29–49, 2008, [Online]. Available: https://sid.ir/paper/123404/en

Related Journal Papers