INTERACTING NON-TURING MACHINES IN ARTIFICIAL INTELLIGENCE AND THE PHILOSOPHY OF INFORMATICS
Vladimir Moiseevich Reznikov
Institute of Philosophy and Law of the Siberian Brench of the Russian Academy of Science, Novosibirsk, Russia
Keywords: Turing model, interactive computing, extended Turing machine, extended model of algorithms, philosophy of computer science
Abstract
As is known, the Turing machine, developed long before the advent of computers, was not intended to take into account the interactions of programs, computers and other devices. However, the operation of the Internet and artificial intelligence involves different types of interactions. In modern computer science, various models have been created that take interactions into account. In this paper, I examined models of extended Turing machines and extended algorithms to determine whether the Turing machine model is adequate to describe and solve the problems that these models can handle. I showed that extended Turing machines correctly describe the behavior of the Turing model and successfully solve the problems that it can handle. Also, in the article I described the problem of controlling the movement of a car driven by a robot by a Turing machine, it does not cope with this problem, but extended Turing models provide a solution to it. Therefore, the question of the strict relationship between the capabilities of Turing machines and extended Turing machines remains open.
|
