Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
This paper was selected by a process of anonymous peer reviewing for presentation at
 

Summary: This paper was selected by a process of
anonymous peer reviewing for presentation at
COMMONSENSE 2007
8th International Symposium on Logical Formalizations of Commonsense Reasoning
Part of the AAAI Spring Symposium Series, March 26-28 2007,
Stanford University, California
Further information, including follow-up notes for some of the
selected papers, can be found at:
www.ucl.ac.uk/commonsense07
Towards a Theory of AI Completeness
Dafna Shahaf and Eyal Amir
Computer Science Department
University of Illinois, Urbana-Champaign
Urbana, IL 61801, USA
{dshahaf2,eyal}@uiuc.edu
Abstract
In this paper we present a novel classification of compu-
tational problems. Motivated by a theoretical investigation
of Artificial Intelligence (AI), we present (1) a complexity
model for computational problems that includes a human in

  

Source: Amir, Eyal - Department of Computer Science, University of Illinois at Urbana-Champaign
Guestrin, Carlos - Center for Automated Learning and Discovery & School of Computer Science, Carnegie Mellon University

 

Collections: Computer Technologies and Information Sciences