Semantics and symbol grounding in Turing machine processes
Semantics and symbol grounding in Turing machine processes
Author(s): Anna SarosiekSubject(s): Semiology, Semantics, Philosophy of Science
Published by: Wydawnictwo Naukowe Uniwersytetu Papieskiego Jana Pawła II w Krakowie
Keywords: Steven Harnad; symbolic system; semantic system; symbol grounding problem; Turing machine; Turing test; Church-Turing Thesis; artificial intelligent; cognition;
Summary/Abstract: The aim of the paper is to present the underlying reason of the unsolved symbol grounding problem. The Church-Turing Thesis states that a physical problem, for which there is an algorithm of solution, can be solved by a Turing machine, but machine operations neglect the semantic relationship between symbols and their meaning. Symbols are objects that are manipulated on rules based on their shapes. The computations are independent of the context, mental states, emotions, or feelings. The symbol processing operations are interpreted by the machine in a way quite different from the cognitive processes. Cognitive activities of living organisms and computation differ from each other, because of the way they act in the real word. The result is the problem of mutual understanding of symbol grounding.
Journal: Semina Scientiarum
- Issue Year: 1/2017
- Issue No: 16
- Page Range: 211-223
- Page Count: 13
- Language: English