Re: Raatikainen's critique of Chaitin
From: Torkel Franzen (torkel_at_sm.luth.se)
Date: 09/05/04
- Next message: Druid: "Space between H2O molecules"
- Previous message: Robert Israel: "Re: Normal convergency"
- In reply to: Eray Ozkural exa: "Re: Raatikainen's critique of Chaitin"
- Next in thread: Eray Ozkural exa: "Re: Raatikainen's critique of Chaitin"
- Reply: Eray Ozkural exa: "Re: Raatikainen's critique of Chaitin"
- Messages sorted by: [ date ] [ thread ]
Date: 05 Sep 2004 08:13:03 +0200
erayo@bilkent.edu.tr (Eray Ozkural exa) writes:
> So, indeed, the theorems of a theory can have higher algorithmic
> complexity than that of the axioms, but by only an additive factor if
> we fix the inference rules.
The complexity of n=n goes to infinity with n.
- Next message: Druid: "Space between H2O molecules"
- Previous message: Robert Israel: "Re: Normal convergency"
- In reply to: Eray Ozkural exa: "Re: Raatikainen's critique of Chaitin"
- Next in thread: Eray Ozkural exa: "Re: Raatikainen's critique of Chaitin"
- Reply: Eray Ozkural exa: "Re: Raatikainen's critique of Chaitin"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
