Information Processing by Symmetric Inductive Turing Machines †
Department of Mathematics, University of California, 520 Portola Plaza, Los Angeles, CA 90095, USA
†
Conference Morphological, Natural, Analog and Other Unconventional Forms of Computing for Cognition and Intelligence (MORCOM), Berkeley, CA, USA, 2–6 June 2019.
Proceedings 2020, 47(1), 28; https://doi.org/10.3390/proceedings2020047028
Published: 13 May 2020
(This article belongs to the Proceedings of IS4SI 2019 Summit)
Traditional models of computations, such as Turing machines or partial recursive functions, perform computations of functions using a definite program controlling these computations. This approach detaches data, which are processed, and the permanent program, which controls this processing. Physical computers often process not only data but also their software (programs). To reflect this peculiarity of physical computers, symmetric models of computations and automata were introduced. In this paper, we study information processing by symmetric models, which are called symmetric inductive Turing machines and reflexive inductive Turing machines.
Keywords:
information; induction; computation; symmetry; computer; efficiency
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
MDPI and ACS Style
Burgin, M. Information Processing by Symmetric Inductive Turing Machines. Proceedings 2020, 47, 28. https://doi.org/10.3390/proceedings2020047028
AMA Style
Burgin M. Information Processing by Symmetric Inductive Turing Machines. Proceedings. 2020; 47(1):28. https://doi.org/10.3390/proceedings2020047028
Chicago/Turabian StyleBurgin, Mark. 2020. "Information Processing by Symmetric Inductive Turing Machines" Proceedings 47, no. 1: 28. https://doi.org/10.3390/proceedings2020047028
Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
