Results 91 to 100 of about 222,866 (106)

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

Simulation of a Turing machine on a digital computer

AFIPS '63 (Fall), 1899
R. W. Coffin, H. Goheen, W. R. Stahl
semanticscholar   +1 more source

Turing Test Considered Mostly Harmless

New generation computing, 2013
D. Berrar, A. Konagaya, A. Schuster
semanticscholar   +2 more sources

Human-level concept learning through probabilistic program induction

Science, 2015
B. Lake, R. Salakhutdinov, J. Tenenbaum
semanticscholar   +1 more source

Three Small Universal Turing Machines

Machines, Computations, and Universality, 2001
C. Baiocchi
semanticscholar   +1 more source