anticipator; anticipation; program; genetic code; Turing machine; rewriting system
Abstract :
[en] This short communication deals with the introduction of the concept of anticipator, which is one who anticipates, in the framework of computing anticipatory systems. The definition of anticipation deals with the concept of program. Indeed, the word program, comes from “pro-gram” meaning "to write before" by anticipation, and means a plan for the programming of a mechanism, or a sequence of coded instructions that can be inserted into a mechanism, or a sequence of coded instructions, as genes or behavioural responses, that is part of an organism. Any natural or artificial programs are thus related to anticipatory rewriting systems, as shown in this paper. All the cells in the body, and the neurons in the brain, are programmed by the anticipatory genetic code, DNA, in a low-level language with four signs. The programs in computers are also computing anticipatory systems. It will be shown, at one hand, that the genetic code DNA is a natural anticipator. As demonstrated by Nobel laureate McClintock [8], genomes are programmed. The fundamental program deals with the DNA genetic code. The properties of the DNA consist in self-replication and self-modification. The self-replicating process leads to reproduction of the species, while the self-modifying process leads to new species or evolution and adaptation in existing ones. The genetic code DNA keeps its instructions in memory in the DNA coding molecule. The genetic code DNA is a rewriting system, from DNA coding to DNA template molecule. The DNA template molecule is a rewriting system to the Messenger RNA molecule. The information is not destroyed during the execution of the rewriting program. On the other hand, it will be demonstrated that Turing machine is an artificial anticipator. The Turing machine is a rewriting system. The head reads and writes, modifying the content of the tape. The information is destroyed during the execution of the program. This is an irreversible process. The input data are lost.
scite shows how a scientific paper has been cited by providing the context of the citation, a classification describing whether it supports, mentions, or contrasts the cited claim, and a label indicating in which section the citation was made.
Bibliography
Dubois, Daniel (1990). LE LABYRINTHE DE L'INTELLIGENCE. De l'intelligence naturelle à l'intelligence fractale. InterEditions, Paris. ACADEMIA, Louvain-la-Neuve
Dubois, Daniel M. (1999), Hyperincursive McCulloch and Pitts Neurons for Designing a Computing Flip-Flop Memory. Computing Anticipatory Systems: CASYS'98 - Second International Conference. Published by The American Institute of Physics, AIP Conference Proceedings 465, pp. 3-21.
Dubois, Daniel M. (2000), Review of Incursive, Hyperincursive and Anticipatory Systems - Foundation of Anticipation in Electromagnetism. Computing Anticipatory Systems: CASYS'99 - Third International Conference. Published by The American Institute of Physics, AIP Conference Proceedings 517, pp. 3-30.
Dubois, Daniel M. (2001), Incursive and Hyperincursive Systems, Fractal Machine, and Anticipatory Logic. Computing Anticipatory Systems: CASYS 2000 - Fourth International Conference. Published by The American Institute of Physics, AIP Conference Proceedings 573, pp. 437-451.
Dubois, Daniel M. (2003), Mathematical Foundations of Discrete and Functional Systems with Strong and Weak Anticipations. In: Butz Martin et al (ed): Anticipatory Behavior in Adaptive Learning Systems, State-of-the-Art Survey. Lecture Notes in Artificial Intelligence, LNAI 2684, pp. 110-132, Springer-Verlag, Berlin, Heidelberg
Dubois, Daniel M. (2008). New Trends in Computing Anticipatory Systems: Emergence of Artificial Conscious Intelligence with Machine Learning Natural Language. Computing Anticipatory Systems: CASYS'07 - Eighth International Conference. Published by The American Institute of Physics, AIP Conference Proceedings 1051, pp. 25-32
François, Charles (1998), The Wishful Anticipator, International Journal of Computing Anticipatory Systems, Volume 2, pp. 44-49.
McClintock, B. (1983), The Significance of responses of the genome to challenge, Nobel lecture, http://nobelprize.org/nobel-prizes/medicine/laureates/ 1983/mcclintock-lecture.pdf
Turing, A.M. (1936). On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society. 2, 42: 230-65, 1937,
and Turing, A.M. (1938). "On Computable Numbers, with an Application to the Entscheidungsproblem: A correction". Proceedings of the London Mathematical Society. 2, 43: 544-6, 1937, http://www.scribd.com/doc/2937039/ Alan-M-Turing-On-Computable-Numbers
Watson, J. D. and F. Crick (1953), Molecular structure of nucleic acids: A Structure for Deoxyribose Nucleic Acid, Nature 171 (4356): 737-738.
Similar publications
Sorry the service is unavailable at the moment. Please try again later.
This website uses cookies to improve user experience. Read more
Save & Close
Accept all
Decline all
Show detailsHide details
Cookie declaration
About cookies
Strictly necessary
Performance
Strictly necessary cookies allow core website functionality such as user login and account management. The website cannot be used properly without strictly necessary cookies.
This cookie is used by Cookie-Script.com service to remember visitor cookie consent preferences. It is necessary for Cookie-Script.com cookie banner to work properly.
Performance cookies are used to see how visitors use the website, eg. analytics cookies. Those cookies cannot be used to directly identify a certain visitor.
Used to store the attribution information, the referrer initially used to visit the website
Cookies are small text files that are placed on your computer by websites that you visit. Websites use cookies to help users navigate efficiently and perform certain functions. Cookies that are required for the website to operate properly are allowed to be set without your permission. All other cookies need to be approved before they can be set in the browser.
You can change your consent to cookie usage at any time on our Privacy Policy page.