|Subject Domain (in DDC)||Computer science, information & general works ♦ Data processing & computer science|
|Subject Keyword||Delian Argument ♦ Turing Machine ♦ Sentence Gt ♦ Human Being ♦ Arbitrary Theory ♦ Delian Anti-mechanist Argument ♦ Logical Fact ♦ Diagonalization Lemma ♦ Mccall Argumentation ♦ Provability Part Company ♦ Storrs Mccall ♦ Mccall Note ♦ Turing Machine Cannot ♦ Uman Being ♦ Provability Predicate ♦ Self-referential Trick ♦ Machine Thinking ♦ Peano Arithmetic Pa ♦ Weakly Represent Provability ♦ Unproved Assumption ♦ Chosen Theory ♦ Incompleteness Theorem ♦ Sharp Dividing Line ♦ Supercompact Cardinal|
|Abstract||Storrs McCall continues the tradition of Lucas and Penrose in an attempt to refute mechanism by appealing to Gödel’s incompleteness theorem (McCall 2001). That is, McCall argues that Gödel’s theorem “reveals a sharp dividing line between human and machine thinking”. According to McCall, “[h]uman beings are familiar with the distinction between truth and theoremhood, but Turing machines cannot look beyond their own output”. However, although McCall’s argumentation is slightly more sophisticated than the earlier Gödelian anti-mechanist arguments, in the end it fails badly, as it is at odds with the logical facts. McCall’s reasoning differs from the earlier Gödelian arguments in his admission that the recognition of truth of Gödel sentence GT for a theory T depends essentially on the unproved assumption that the theory T under consideration is consistent. But, so the argument continues, still human beings, but not Turing machines, can see that truth and provability part company. For, McCall notes, we can argue by cases: Case 1. T is consistent. GT is unprovable, but true. Case 2. T is inconsistent. GT is provable, but false. Whichever alternative holds, McCall concludes, truth and provability fail to coincide. According to McCall, human beings can see this, but a Turing machine cannot. The conclusion, however, is simply false. McCall does not seem to realize that e.g. in Peano Arithmetic PA one can formalize and prove Gödel’s theorem for an arbitrary theory, however strong (McCall considers Zermelo-Fraenkel set theory ZFC, but one can take just any theory, e.g. ZFC + there exist supercompact cardinals, i.e. the sky is the limit, as long as the theory is effectively axiomatizable). More exactly, one can, in PA, formalize and weakly represent provability in any chosen theory T; let us denote such a provability predicate by ProvT(x). Gödel’s self-referential trick (the diagonalization lemma) then provides a sentence GT such that|
|Educational Role||Student ♦ Teacher|
|Age Range||above 22 year|
|Education Level||UG and PG ♦ Career/Technical Study|
National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.
NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.
Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.
For any issue or feedback, please write to email@example.com