<--- Back to Details
First PageDocument Content
Computer science / Philosophy of artificial intelligence / Turing machine / Computability theory / Models of computation / Turing test / Universal Turing machine / Computability / Mind / Alan Turing / Science / Artificial intelligence
Date: 2013-10-22 13:32:31
Computer science
Philosophy of artificial intelligence
Turing machine
Computability theory
Models of computation
Turing test
Universal Turing machine
Computability
Mind
Alan Turing
Science
Artificial intelligence

Add to Reading List

Source URL: www.nyu.edu

Download Document from Source Website

File Size: 1,77 MB

Share Document on Facebook

Similar Documents

Eleventh International Conference on Computability, Complexity and Randomness CCR ‘16

DocID: 1v9oV - View Document

On the Weak Computability of Continuous Real Functions Matthew S. Bauer and Xizhong Zheng Department of Computer Science and Mathematics Arcadia University Glenside, PA 19038, USA {mbauer, zhengx}@arcadia.edu

DocID: 1uNDW - View Document

The Computability of Relaxed Data Structures: Queues and Stacks as Examples∗ Nir Shavit† Gadi Taubenfeld‡

DocID: 1u1Cb - View Document

Speaker: Jason Rute Title: Randomness, Brownian Motion, Riesz Capacity, and Complexity Abstract: Algorithmic randomness is a topic in computability theory which investigates which paths in a stochastic process behave ran

DocID: 1sWjT - View Document

Computability and Complexity Results for a Spatial Assertion Language for Data Structures Cristiano Calcagno1,2 , Hongseok Yang3 , and Peter W. O’Hearn1 1 Queen Mary, University of London

DocID: 1sTVM - View Document