arXiv:1109.5951v2 [cs.AI] 29 Sep[removed]An Approximation of the Universal Intelligence Measure Shane Legg DeepMind Technologies Ltd

Source URL: arxiv.org

• Artificial intelligence
• Intelligence
• Intelligence tests
• Philosophy of artificial intelligence
• Turing test
• Intelligent agent
• Marcus Hutter
• Universal Intelligence
• G factor
• Statistics
• Science
• Educational psychology

Memcomputing NP-complete problems in polynomial time using polynomial resources and collective states Fabio L. Traversa,1, 2, ∗ Chiara Ramella,2, † Fabrizio Bonani,2, ‡ and Massimiliano Di Ventra1, § arXiv:[removed]

Source URL: arxiv.org

• Turing machine
• Models of computation
• Mathematical optimization
• Structural complexity theory
• Computational complexity theory
• NP
• P versus NP problem
• Reduction
• P-complete
• Theoretical computer science
• Applied mathematics
• Complexity classes

Caracteres de seguridad CAPTCHA Captcha es el acrónimo de Completely Automated Public Turing test to tell Computers and Humans Apart (Prueba de Turing pública y automática para diferenciar máquinas y humanos). Se tra

Source URL: www.pearsonbv.com

Foundations of Software Technology and Theoretical Computer Science (Bangalore[removed]Editors: R. Hariharan, M. Mukund, V. Vinay; pp[removed]The Complexity of Tree Transducer Output Languages Kazuhiro Inaba1 and Sebastia

Source URL: www.kmonos.net

• Computer science
• Binary tree
• Computation tree
• Symbol
• Finite-state machine
• Non-deterministic Turing machine
• Automata theory
• Theoretical computer science
• Models of computation

A paradox related to the Turing Test Samuel A. Alexander∗ Department of Mathematics, the Ohio State University Published in The Reasoner vol. 5, issue 6, p. 90. I will describe a paradox which arises assuming it is pos

Source URL: www.semitrivial.com

• Computer science
• Alan Turing
• Formal methods
• Models of computation
• Computable function
• Turing machine
• Computability
• Turing test
• Computable number
• Computability theory
• Theoretical computer science
• Theory of computation

Samuel A. Alexander Research Statement 1 Applications of Mathematics to Theoretical Computer Science 1.1 Knowing machines . . . . . . . . . . . . . . . . . . . . . . . . . . . 1.2 A machine that knows its own code . . .

Source URL: www.semitrivial.com

• Logic
• Ordinal numbers
• Theory of computation
• Turing jump
• Recursively enumerable set
• Proof theory
• Ordinal arithmetic
• Enumeration
• Algorithm
• Mathematical logic
• Mathematics
• Computability theory

Manuscript draft Nov.29, 2007 The Neural Net of the Tapeworm Turingium universalis (Wolfram) Erwin Engeler, ETH Zurich, Switzerland T.universalis, was first described by Wolfram in Campaign, Illinois, U.S.A. and by Smith

Source URL: www.math.ethz.ch

• Mind
• Neuroscience
• Computational neuroscience
• Neuron
• Neural network
• Alan Turing
• Turing machine
• Science
• Nervous system

PHYSICAL REVIEW E, VOLUME 64, [removed]Turing model for the patterns of lady beetles S. S. Liaw,1 C. C. Yang,2 R. T. Liu,1 and J. T. Hong1 1

Source URL: atom3.cs.mcgill.ca

• Distribution
• Mathematical analysis
• Mathematical modeling
• Reaction–diffusion system

Beyond the Turing Test Concluding that there is no one test for machine intelligence, AI researchers develop a battery of research challenges By Jia You A

Source URL: vision.stanford.edu

• British people
• Philosophy of artificial intelligence
• Human–computer interaction
• Turing test
• Turing
• Turing machine
• Science
• Artificial intelligence
• Alan Turing

OVERLOAD CONTENTS OVERLOAD 117 October 2013

Source URL: accu.org

• Software architecture
• Theoretical computer science
• Turing machine
• Formal methods
• Cohesion
• Coupling
• Algorithm
• Source lines of code
• Alan Turing
• Software engineering
• Software metrics
• Computing