Results 251 to 260 of about 284,160 (268)
Some of the next articles are maybe not open access.
Cybernetics and Systems Analysis, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Proceedings of the 1988 IEEE International Conference on Systems, Man, and Cybernetics, 2005
Turing suggested to replace the question "Can machines think?" with a question concerning the so called "imitation game". In the first part of this note, we examine some epistemological problems concerning the structure of the imitation game and revealing an internal tension in Turing's position.
Guccione S., TAMBURRINI, GUGLIELMO
openaire +2 more sources
Turing suggested to replace the question "Can machines think?" with a question concerning the so called "imitation game". In the first part of this note, we examine some epistemological problems concerning the structure of the imitation game and revealing an internal tension in Turing's position.
Guccione S., TAMBURRINI, GUGLIELMO
openaire +2 more sources
�������������� Turing ������ ��������������������������������������:
2012In this report we provide an introduction to the study of Turing machines and the classical theory of computation as well as the burgeoning field of hypercomputation - the study of machines that can compute more than Turing machines. We take an extensive survey of many of the key concepts in the field, tying together the disparate ideas and presenting ...
openaire +1 more source
Current Biology
Embryo axis formation begins with the localized expression of biochemical signals, which organize cell movements and determine cell fate. A quail study finds that tissue contraction and resulting long-range changes in tissue tension restrict the area where these biochemical signals are expressed.
Naoya, Hino +2 more
openaire +2 more sources
Embryo axis formation begins with the localized expression of biochemical signals, which organize cell movements and determine cell fate. A quail study finds that tissue contraction and resulting long-range changes in tissue tension restrict the area where these biochemical signals are expressed.
Naoya, Hino +2 more
openaire +2 more sources
2012
We enhance the notion of a computation of the classical theory of computing with the notion of interaction from concurrency theory. In this way, we enhance a Turing machine as a model of computation to a Reactive Turing Machine that is an abstract model of a computer as it is used nowadays, always interacting with the user and the world.
Baeten, J.C.M. +2 more
openaire +2 more sources
We enhance the notion of a computation of the classical theory of computing with the notion of interaction from concurrency theory. In this way, we enhance a Turing machine as a model of computation to a Reactive Turing Machine that is an abstract model of a computer as it is used nowadays, always interacting with the user and the world.
Baeten, J.C.M. +2 more
openaire +2 more sources
Minds and Machines, 2000
Turing's test has been much misunderstood. Recently unpublished material by Turing casts fresh light on his thinking and dispels a number of philosophical myths concerning the Turing test. Properly understood, the Turing test withstands objections that are popularly believed to be fatal.
openaire +1 more source
Turing's test has been much misunderstood. Recently unpublished material by Turing casts fresh light on his thinking and dispels a number of philosophical myths concerning the Turing test. Properly understood, the Turing test withstands objections that are popularly believed to be fatal.
openaire +1 more source
Minds and Machines, 2002
Summary: Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of \(\pi\) contains \(n\) consecutive 7s, for any \(n\); solve the Turing-machine halting problem; and decide the predicate ...
openaire +2 more sources
Summary: Accelerating Turing machines are Turing machines of a sort able to perform tasks that are commonly regarded as impossible for Turing machines. For example, they can determine whether or not the decimal representation of \(\pi\) contains \(n\) consecutive 7s, for any \(n\); solve the Turing-machine halting problem; and decide the predicate ...
openaire +2 more sources
Steve Turing: Minecraft es Turing completo
2023Una máquina es Turing completa si tiene el poder de cómputo de una máquina de Turing universal. En este trabajo se busca probar que Minecraft, el videojuego de construcción sueco, es una máquina Turing completa. Para la prueba de este tipo de resultados se debe construir una máquina universal dentro del mismo sistema, en este caso el juego.
openaire +1 more source
Communications of the ACM, 2014
Assessing the accuracy of popular descriptions of Alan Turing's influences and legacy.
openaire +3 more sources
Assessing the accuracy of popular descriptions of Alan Turing's influences and legacy.
openaire +3 more sources