Volume 21, Issue 4, November 2017, Pages 630–634
A.-Roger LULA BABOLE1
1 Département de Mathématiques et Informatique, Université de Kinshasa, RD Congo
Original language: French
Copyright © 2017 ISSR Journals. 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.
The degree of freedom of a machine is organized and specified by a human been. Even it’s well known that a machine is very quick and very reliable than a human been; this remain in the center because the algorithm was made by him. The calculable functions in TURING’s machine are all calculable in intuitive point of view. So there are the undecidable properties in all axiomatic for formalizing the arithmetic.
Author Keywords: incompleteness, artificial intelligence, TURING’s machine, consistence, undecidability, human spirit.
A.-Roger LULA BABOLE1
1 Département de Mathématiques et Informatique, Université de Kinshasa, RD Congo
Original language: French
Copyright © 2017 ISSR Journals. 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.
Abstract
The degree of freedom of a machine is organized and specified by a human been. Even it’s well known that a machine is very quick and very reliable than a human been; this remain in the center because the algorithm was made by him. The calculable functions in TURING’s machine are all calculable in intuitive point of view. So there are the undecidable properties in all axiomatic for formalizing the arithmetic.
Author Keywords: incompleteness, artificial intelligence, TURING’s machine, consistence, undecidability, human spirit.
Abstract: (french)
Le degré de liberté de la machine est organisé et spécifié par l’homme. Quand bien même la machine dépasse l’homme en rapidité et en fiabilité, celui-ci reste le maître de l’algorithme et marque dans la conception de l’algorithme sa supériorité vis-à-vis de la machine qui ne doit qu’exécuter l’algorithme qui a été prévu. Les fonctions calculables à la TURING sont toutes calculables au sens intuitif. Ainsi, il y a des propriétés indécidables dans toute axiomatique pour formaliser l’arithmétique.
Author Keywords: incomplétude, intelligence artificielle, machine de TURING, consistance, indécidabilité, esprit humain.
How to Cite this Article
A.-Roger LULA BABOLE, “Incomplétude et intelligence artificielle,” International Journal of Innovation and Applied Studies, vol. 21, no. 4, pp. 630–634, November 2017.
