flâneur

Resource-Limited Reflective Oracles — AI Alignment Forum

alignmentforum.org · 1,450 words · saved by 1 readers

Reflective oracles accurately answer questions about what arbitrary halting probabilistic oracle machines output. It is possible to make a variant of a reflective oracle that accurately answers questions about what sufficiently short-running Turing machines with access to the same oracle output. These oracles are explicitly computable, fairly powerful in a computational complexity sense, and can probably be used to make a reflective version of AIXItl, (which will not happen in this particular post) The theorems in this post are not exhaustive at all, just the stuff I was able to figure out in ~2 hours, so there is almost certainly low-hanging fruit in figuring out how these interact with the standard arsenal of theorems in computational complexity theory. #Motivation: Let's say we want to make an oracle that is reflective over all TM's that run in polynomial time. How do we do that? The obvious approach is to let a query consist of a tuple of a turing machine T , a number n , a bitst

x Resource-Limited Reflective Oracles — AI Alignment Forum Oracle AI Personal Blog 10 Resource-Limited Reflective Oracles by Diffractor 6th Jun 2018 4 min read 2 10 Reflective oracles accurately answer questions about what arbitrary halting probabilistic oracle machines output. It is possible to make a variant of a reflective oracle that accurately answers questions about what sufficiently short-running Turing machines with access to the same oracle output. These oracles are explicitly computable, fairly powerful in a computational complexity sense, and can probably be used to make a reflectiv

related reading