Open Access. Powered by Scholars. Published by Universities.®

Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering

PDF

Faculty Scholarship

Series

AI

Articles 1 - 1 of 1

Full-Text Articles in Engineering

Impossibility Results In Ai: A Survey, Mario Brcic, Roman Yampolskiy Sep 2021

Impossibility Results In Ai: A Survey, Mario Brcic, Roman Yampolskiy

Faculty Scholarship

An impossibility theorem demonstrates that a particular problem or set of problems cannot be solved as described in the claim. Such theorems put limits on what is possible to do concerning artificial intelligence, especially the super-intelligent one. As such, these results serve as guidelines, reminders, and warnings to AI safety, AI policy, and governance researchers. These might enable solutions to some long-standing questions in the form of formalizing theories in the framework of constraint satisfaction without committing to one option. In this paper, we have categorized impossibility theorems applicable to the domain of AI into five categories: deduction, indistinguishability, induction, …