Re: Raatikainen's critique of Chaitin
From: Eray Ozkural exa (erayo_at_bilkent.edu.tr)
Date: 09/12/04
- Next message: fei: "A variant of Traveling Salesman Problem"
- Previous message: Kent Paul Dolan: "Re: Undecidable problem examples"
- In reply to: Torkel Franzen: "Re: Raatikainen's critique of Chaitin"
- Next in thread: Torkel Franzen: "Re: Raatikainen's critique of Chaitin"
- Reply: Torkel Franzen: "Re: Raatikainen's critique of Chaitin"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 12 Sep 2004 14:37:24 -0700
Torkel Franzen <torkel@sm.luth.se> wrote in message news:<vcb8ybfiozm.fsf@beta19.sm.ltu.se>...
> cafeinst@msn.com (Craig Feinstein) writes:
>
> > Correction. I should have said "any FAS that is as powerful as PA or
> > more powerful than PA".
>
> No, you should have removed the unnecessary assumption that the
> system has only a finite number of axioms.
It has never been the suggestion that the number of axioms, hence the
axiom string is finite. Instead, the suggestion has been that the
Kolmogorov complexity of the axiom schema is finite, all along,
regardless of the length of the axiom string. Once more, you have
skipped upon the exact definition to arrive at a conclusion you would
prefer.
Take care,
-- Eray Ozkural
- Next message: fei: "A variant of Traveling Salesman Problem"
- Previous message: Kent Paul Dolan: "Re: Undecidable problem examples"
- In reply to: Torkel Franzen: "Re: Raatikainen's critique of Chaitin"
- Next in thread: Torkel Franzen: "Re: Raatikainen's critique of Chaitin"
- Reply: Torkel Franzen: "Re: Raatikainen's critique of Chaitin"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|