Home // INTELLI 2012, The First International Conference on Intelligent Systems and Applications // View article

Primary Language for Semantic Computations and Communication without Syntax

Authors:
Petro Gopych

Keywords: context; infinity; meaning; subjectivity; categorization; complexity; super-Turing computations

Abstract:
Recent binary signal detection theory (BSDT), extended by its infinity hypothesis (infinity of common prehistory of universe, life, and mind), is called extended BSDT. Its basic notions underlie BSDT primary language (PL, a hypothetical genuine mathematics used by animals for their internal computations). BSDT PL operates with meaningful words defined as finite binary affixes to infinite binary strings that have common infinite initial parts. In this paper, by an analysis of composite PL words (sentences), it has been demonstrated that meanings of their constituents can only conditionally be related. Meanings of composite words taken as a whole are perceived unambiguously and, under condition that communicated parties have common evolution history (respective infinite strings share their infinite initial part), make possible reliable, in particular non-syntactic, meaningful (semantic) communication. It has also been shown the BSDT neural network learning paradigm, “one-memory-trace-per-one-network”, and super-Turing hyper-computations are the mandatory requirements for doing semantic computations and for unambiguous understanding of meanings of finite symbolic messages. Numerical and empirical evidences of some PL predictions and potential PL applications are briefly discussed.

Pages: 47 to 53

Copyright: Copyright (c) IARIA, 2012

Publication date: April 29, 2012

Published in: conference

ISSN: 2308-4065

ISBN: 978-1-61208-224-0

Location: Chamonix, France

Dates: from April 29, 2012 to May 4, 2012