Work

Some Assumptions about Problem Solving Representation in Turing’s Model of Intelligence

Year: 1970

Type: article

Abstract: 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.

Source: tripleC Communication Capitalism & Critique Open Access Journal for a Global Sustainable Information Society

DOI: 10.31269/triplec.v4i2.29

Authors: Raymundo Morado, Francisco Hernández-Quiroz

Institution: Universidad Nacional Autónoma de México

Language: English

Topic: Computability, Logic, AI Algorithms

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W1604640555

FWCI:

Cites: 14

Cited by: 1

Related to: 10