Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Engineering
Efficiency Theory: A Unifying Theory For Information, Computation And Intelligence, Roman V. Yampolskiy
Efficiency Theory: A Unifying Theory For Information, Computation And Intelligence, Roman V. Yampolskiy
Faculty Scholarship
The paper serves as the first contribution towards the development of the theory of efficiency: a unifying framework for the currently disjoint theories of information, complexity, communication and computation. Realizing the defining nature of the brute force approach in the fundamental concepts in all of the above mentioned fields, the paper suggests using efficiency or improvement over the brute force algorithm as a common unifying factor necessary for the creation of a unified theory of information manipulation. By defining such diverse terms as randomness, knowledge, intelligence and computability in terms of a common denominator we are able to bring together …
Turing Test As A Defining Feature Of Ai-Completeness, Roman V. Yampolskiy
Turing Test As A Defining Feature Of Ai-Completeness, Roman V. Yampolskiy
Faculty Scholarship
The paper contributes to the development of the theory of AI-Completeness by formalizing the notion of AI-Complete, C-Complete and AI-Hard problems. The intended goal is to provide a classification of problems in the field of Artificial General Intelligence. We prove Turing Test to be an instance of an AI-Complete problem and further show certain AI problems to be AI-Complete or AI-Hard via polynomial time reductions. Finally, the paper suggests some directions for future work on the theory of AI-Completeness.