Results 101 to 110 of about 154,109 (120)

Evolving Turing machines from examples [PDF]

, 1998
The aim of this paper is to investigate the application of evolutionary approachesto the automatic design of automata in general, and Turing machines, in particular. Here, each automaton is represented directly by its state transition table and the number of states is allowed to change dynamically as evolution takes place.
J. Tanomaru
openaire   +2 more sources

STUDYING THE BASIS OF ALGORITHMIZATION BY THE EXAMPLE OF THE TURING MACHINE USING GAME TECHNOLOGY

Informatics in school, 2018
The article presents detailed solutions of a few algorithmic problems on the example of the Turing machine with a detailed description of the form of work at the lesson. Particular attention is paid to the description of the game learning method “Presenting algorithm as role game in Turing machine”.
M. Yu. Vtyurin, I. E. Belotserkovskaya
openaire   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Topological entropy of Turing complete dynamics

arXiv.org
We explore the relationship between Turing completeness and topological entropy of dynamical systems. We first prove that a natural class of Turing machines that we call"regular Turing machines"(which includes most of the examples of universal Turing ...
Renzo Bruera, Robert Cardona, Eva Miranda, D. Peralta-Salas   +3 more
semanticscholar   +1 more source

Improving the Security of Audio CAPTCHAs With Adversarial Examples

IEEE Transactions on Dependable and Secure Computing
CAPTCHAs (completely automated public Turing tests to tell computers and humans apart) have been the main protection against malicious attacks on public systems for many years.
Ping Wang, Haichang Gao, Xiaoyan Guo, Zhongni Yuan, Jiawei Nian   +4 more
semanticscholar   +1 more source

When Redundancy Matters: Machine Teaching of Representations

arXiv.org
In traditional machine teaching, a teacher wants to teach a concept to a learner, by means of a finite set of examples, the witness set. But concepts can have many equivalent representations.
César Ferri, Darío Garigliotti, B. Håvardstun, Jos'e Hern'andez-Orallo, J. A. Telle   +4 more
semanticscholar   +1 more source

Memory and the Computational Brain: Why Cognitive Science will Transform Neuroscience

, 2009
Preface. 1. Information. Shannon's Theory of Communication. Measuring Information. Efficient Coding. Information and the Brain. Digital and Analog Signals. Appendix: The Information Content of Rare Versus Common Events and Signals. 2.
C. Gallistel, A. P. King
semanticscholar   +2 more sources

On computable numbers, with an application to the Entscheidungsproblem

Proc. London Math. Soc., 1937
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. Abbreviated tables Further examples. 5.
A. Turing
semanticscholar   +1 more source

Towards a molecular logic machine

, 2001
Finite state logic machines can be realized by pump–probe spectroscopic experiments on an isolated molecule. The most elaborate setup, a Turing machine, can be programmed to carry out a specific computation.
F. Remacle, R. Levine
semanticscholar   +1 more source

In defense of the Turing test

Ai & Society, 2020
E. Neufeld, Sonje Finnestad
semanticscholar   +1 more source

On Tight Separation for Blum Measures Applied to Turing Machine Buffer Complexity

Fundamenta Informaticae, 2017
Jirí Síma, S. Zák
semanticscholar   +1 more source