Re: ESSAY: Program length, Omega and Friendliness

From: Philip Goetz (
Date: Wed Mar 01 2006 - 08:31:29 MST

On 2/28/06, William Pearson <> wrote:
> On 28/02/06, Philip Goetz <> wrote:
> > Can you restate what exactly you're trying to prove?
> I am attempting to find the limits of what a formal proof system can
> transform itself into whilst trying to maintain an undecidable
> property. In this case friendliness. I am interested in things that
> change the system in meaningful ways, hence why transforming itself
> into an infinite number of systems that do the same thing is
> uninteresting.

Can you give a more precise statement, such as one would see at the
beginning of a proof?

This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:00:56 MDT