Re: Panu Raatikainen's review of two of Chaitin's books.
From: Torkel Franzen (torkel_at_sm.luth.se)
Date: 05/13/04
- Next message: Will Twentyman: "Re: functions that halt"
- Previous message: Eray Ozkural exa: "Re: Panu Raatikainen's review of two of Chaitin's books."
- In reply to: Eray Ozkural exa: "Re: Panu Raatikainen's review of two of Chaitin's books."
- Next in thread: Eray Ozkural exa: "Re: Panu Raatikainen's review of two of Chaitin's books."
- Reply: Eray Ozkural exa: "Re: Panu Raatikainen's review of two of Chaitin's books."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: 13 May 2004 16:12:26 +0200
erayo@bilkent.edu.tr (Eray Ozkural exa) writes:
> The correlation I have on my mind is digital. But let me first become
> sure of your reference in "a set of axioms of enormous complexity that
> proves only a set of truths of the form s+t=u".
Trivially, for every n there is an arithmetical axiom A of the form
k+1=1+k such that the Kolmogorov complexity of A is greater than
n. Anything A proves is a consequence of the low-complexity axiom
(x)(x+1=1+x). Thus it is unclear what you have in mind in speaking of
a direct dependence between the complexity of a formal system and its
capacity to prove theorems. How is this dependence to be spelled out?
- Next message: Will Twentyman: "Re: functions that halt"
- Previous message: Eray Ozkural exa: "Re: Panu Raatikainen's review of two of Chaitin's books."
- In reply to: Eray Ozkural exa: "Re: Panu Raatikainen's review of two of Chaitin's books."
- Next in thread: Eray Ozkural exa: "Re: Panu Raatikainen's review of two of Chaitin's books."
- Reply: Eray Ozkural exa: "Re: Panu Raatikainen's review of two of Chaitin's books."
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Relevant Pages
|