PL EN


2017 | 16 |
Article title

Semantics and symbol grounding in Turing machine processes

Authors
Content
Title variants
Languages of publication
PL
Abstracts
EN
The aim of the paper is to present the underlying reason of the unsolved symbolgrounding problem. The Church-Turing Thesis states that a physical problem,for which there is an algorithm of solution, can be solved by a Turingmachine, but machine operations neglect the semantic relationship betweensymbols and their meaning. Symbols are objects that are manipulated on rulesbased on their shapes. The computations are independent of the context, mentalstates, emotions, or feelings. The symbol processing operations are interpretedby 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 ofmutual understanding of symbol grounding.
Year
Volume
16
Physical description
Dates
published
2017
online
2018-07-31
Contributors
author
References
Document Type
Publication order reference
Identifiers
YADDA identifier
bwmeta1.element.ojs-doi-10_15633_ss_2492
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.