Re: Raatikainen's critique of Chaitin
From: Torkel Franzen (torkel_at_sm.luth.se)
Date: 09/01/04
- Next message: Howard: "Re: [PO] Can a regular Turing Machine provide Protected Memory?"
- Previous message: Simon G Best: "Re: [PO] Can a regular Turing Machine provide Protected Memory?"
- 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 ] [ subject ] [ author ]
Date: 01 Sep 2004 18:22:24 +0200
erayo@bilkent.edu.tr (Eray Ozkural exa) writes:
> You'll have to take that issue with Alexander Shen who is a
> distinguished mathematician, in my opinion, and probably has better
> handle on the subject than either of us.
There's nothing to take up. You've just misread Shen.
> Not really. Martin-Lof randomness is equivalent to weak Chaitin
> random, Solovay randomness is equivalent to Chaitin random.
They're all equivalent.
> Limit of algorithmic information content H(s) of initial segments r_n
> while n->infinity
This limit need not exist.
- Next message: Howard: "Re: [PO] Can a regular Turing Machine provide Protected Memory?"
- Previous message: Simon G Best: "Re: [PO] Can a regular Turing Machine provide Protected Memory?"
- 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 ] [ subject ] [ author ]
Relevant Pages
|