Scholarlink

<p>Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of supernormal numbers that correspond to semicomputable relativizations, and that of highly normal numbers in terms of computable ones. We prove several properties of these new randomness concepts. Both supernormality and high normality generalize Borel absolute normality. Supernormality is strictly between 2-randomness and effective dimension 1, while high normality corresponds exactly to sequences of computable dimension 1 providing a more natural characterization of this class.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Normality, Relativization, and Randomness

  • 期刊论文

  • 发表日期：

    2025年6月21日

查看全文
  • Wesley Calvert,
  • Emma Gruner,
  • Elvira Mayordomo,
  • Daniel Turetsky,
  • Java Darleen Villano

摘要

Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of supernormal numbers that correspond to semicomputable relativizations, and that of highly normal numbers in terms of computable ones. We prove several properties of these new randomness concepts. Both supernormality and high normality generalize Borel absolute normality. Supernormality is strictly between 2-randomness and effective dimension 1, while high normality corresponds exactly to sequences of computable dimension 1 providing a more natural characterization of this class.