Some Assumptions about Problem Solving Representation in Turing’s Model of Intelligence
Bibliographic Data
| ID | 21187706 |
|---|---|
| Authors | Raymundo Morado (Universidad Nacional Autonoma de Mexico), Francisco Hernández-Quiroz (0000-0002-9748-0201, Universidad Nacional Autonoma de Mexico) |
| Year | 1970 |
| Volume | 4 |
| Issue | 2 |
| Pages | 136-142 |
| Publication date | 1970-01-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | tripleC Communication Capitalism & Critique Open Access Journal for a Global Sustainable Information Society (JOURNAL) |
| Journal identifiers | ISSN: 1726-670X • E-ISSN: 1726-670X |
| Publisher | Information Society Research (PUBLISHER) |
| DOI | 10.31269/triplec.v4i2.29 |
| OpenAlex | W1604640555 |
| Language | EN |
| References cited | 2 |
Turing machines as a model of intelligence can be motivated under some assumptions, both mathematical and philosophical. Some of these are about the possibility, the necessity, and the limits of representing problem solving by mechanical means. The assumptions about representation that we consider in this paper are related to information representability and availability, processing as solving, nonessentiality of complexity issues, and finiteness, discreteness and sequentiality of the representation. We discuss these assumptions and particularly something that might happen if they were to be rejected or weakened. Tinkering with these assumptions sheds light on the import of alternative computational models
Algorithm · Cognitive science · Computation · Programming language · Super-recursive algorithm · Turing · Turing machine · Universal Turing machine · Cellular Automata and Applications · Computability, Logic, AI Algorithms · Computer Science · Evolutionary Algorithms and Applications · Psychology · Artificial Intelligence · Theoretical Computer Science
| Highly cited | No |
|---|