## Abstract

Following Lutz's approach to effective (constructive) dimension, we define a notion of dimension for individual sequences based on Schnorr's concept(s) of randomness. In contrast to computable randomness and Schnorr randomness, the dimension concepts defined via computable martingales and Schnorr tests coincide, that is, the Schnorr Hausdorff dimension of a sequence always equals its computable Hausdorff dimension. Furthermore, we give a machine characterisation of the Schnorr dimension, based on prefix-free machines whose domain has computable measure. Finally, we show that there exist computably enumerable sets that are Schnorr (computably) irregular: while every c.e. set has Schnorr Hausdorff dimension 0, there are c.e. sets of computable packing dimension 1, which is, from Barzdiņš Theorem, an impossible property for the case of effective (constructive) dimension. In fact, we prove that every hyperimmune Turing degree contains a set of computable packing dimension 1.

Original language | English (US) |
---|---|

Pages (from-to) | 789-811 |

Number of pages | 23 |

Journal | Mathematical Structures in Computer Science |

Volume | 16 |

Issue number | 5 |

DOIs | |

State | Published - Oct 1 2006 |

## All Science Journal Classification (ASJC) codes

- Mathematics (miscellaneous)
- Computer Science Applications