Towards a theory of AI completeness

AAAI Spring Symposium - Technical Report

Volumn SS-07-05, Issue , 2007, Pages 150-155

  Shahaf, Dafna ^a   Amir, Eyal ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CASE BASED REASONING; COMPUTATIONAL COMPLEXITY; USER INTERFACES;

COMPUTATIONAL PROBLEMS; PROTOTYPICAL PROBLEMS;

ARTIFICIAL INTELLIGENCE;

EID: 37349060660     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Blum, M. 1967. A machine-independent theory of the complexity of recursive functions. J. ACM 14(2):322-336.
2. Bradford, P. G., and Wollowski, M. 1995. A formalization of the hiring test. SIGARTBulletin 6(4):3-10.
3. Brown, A. B., and Hellerstein, J. L. 2004. An approach to benchmarking configuration complexity. In EWII: Proceedings of the IIth workshop on ACM SIGOPS European workshop: beyond the PC, 18. NY, USA.
4. Gentry, C.; Ramzan, Z.; and Stubblebine, S. 2005. Secure distributed human computation. In EC '05: Proceedings of the 6th ACM conference on Electronic commerce. NY, USA: ACM Press.
5. Shieber, S. M. 2006. Does the Turing Test demonstrate intelligence or not? In Proceedings of the Twenty-First National Conference on Artificial Intelligence (AAAI-06).
6. Takagi, H. 2001. Interactive evolutionary computation: Fusion of the capabilities of EC optimization and human evaluation. Proceedings of the IEEE 89(9): 1275-1296.
7. Turing, A. M. 1938. Systems of logic based on ordinals: a dissertation. Ph.D. dissertation, Cambridge University, Cambridge, UK. Published by Hodgson Son, London, UK.
8. von Ahn, L.; Blum, M.; Hopper, N.; and Langford, J. 2003. Captcha: Using hard AI problems for security. In Proceedings of Euwcrypt, 294-311.
9. von Ahn, L. 2006. Games with a purpose. Computer 39(6).