Intelligent Agent Foundations Forumsign up / log in
by Sam Eisenstat 1010 days ago | link | parent

We can also construct an example where \({\rm PA} \vdash \phi \rightarrow \psi\) with a short proof and \(\rm PA\) also proves \(\phi \rightarrow \neg\psi\), but any such proof is much longer. We only need to put a bound on the proof length in A’s proof search. Then, the argument that \({\tt A()} = 1 \wedge {\tt U()} \ne 0\) proves its own consistency still works, and is rather short: \(O(\log n)\) as the proof length bound \(n\) increases. However, there cannot be a proof of \({\tt A()} = 1 \rightarrow {\tt U()} = 10\) within \({\tt A}\)’s proof length bound, since if it found one it would immediately take action 1. In this case \(\rm PA\) can still prove that \({\tt A()} = 1 \rightarrow {\tt U()} = 10\) simply by running the agent, but this argument shows that any such proof must be long.



NEW LINKS

NEW POSTS

NEW DISCUSSION POSTS

RECENT COMMENTS

I think that in that case,
by Alex Appel on Smoking Lesion Steelman | 1 like

Two minor comments. First,
by Sam Eisenstat on No Constant Distribution Can be a Logical Inductor | 1 like

A: While that is a really
by Alex Appel on Musings on Exploration | 0 likes

> The true reason to do
by Jessica Taylor on Musings on Exploration | 0 likes

A few comments. Traps are
by Vadim Kosoy on Musings on Exploration | 1 like

I'm not convinced exploration
by Abram Demski on Musings on Exploration | 0 likes

Update: This isn't really an
by Alex Appel on A Difficulty With Density-Zero Exploration | 0 likes

If you drop the
by Alex Appel on Distributed Cooperation | 1 like

Cool! I'm happy to see this
by Abram Demski on Distributed Cooperation | 0 likes

Caveat: The version of EDT
by 258 on In memoryless Cartesian environments, every UDT po... | 2 likes

[Delegative Reinforcement
by Vadim Kosoy on Stable Pointers to Value II: Environmental Goals | 1 like

Intermediate update: The
by Alex Appel on Further Progress on a Bayesian Version of Logical ... | 0 likes

Since Briggs [1] shows that
by 258 on In memoryless Cartesian environments, every UDT po... | 2 likes

This doesn't quite work. The
by Nisan Stiennon on Logical counterfactuals and differential privacy | 0 likes

I at first didn't understand
by Sam Eisenstat on An Untrollable Mathematician | 1 like

RSS

Privacy & Terms