Skip to content
DraconiticResearch
Search Sources API
190,869 studies31 sourcesUpdated 2 min ago
PreprintCC BY 4.0arXiv

Non-aware computable presentations of randomizations

Abstract

Let 2 be the two-element structure in the empty signature. We build a computable presentation Q of the Borel randomization 2[0,1) in which neither constant random variable is a computable point. Consequently, Q is not aware. This gives a negative answer to a question of Cuervo Ovalle and Goldbring \cite{CG}. We also construct a countable structure M with no computable presentation but M[0,1) has a computable presentation. This answers another question and establishes the necessity of the awareness condition stated in one of the main theorems in \cite{CG}.

Related

  1. Computable presentations of reduced group C*-algebras of hyperbolic groups
    Isaac Goldbring
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsLogic & foundationsarXiv
  2. Computable presentations of reduced group C*-algebras of groups with the rapid decay property
    Isaac Goldbring
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsLogic & foundationsarXiv
  3. Computable presentations of separable Lebesgue spaces
    Ruofei Xie, Xuanheng Zhao
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsLogic & foundationsarXiv
  4. The computable functional calculus
    Christopher J. Eagle, Timothy H. McNicholl
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsLogic & foundationsarXiv
  5. Effective recurrence for computable measure-preserving transformations
    Joey Veltri
    arXivPreprintarXiv licenceFull textDynamical systemsLogic & foundationsarXiv
BibTeX
@misc{zhao2026nonaware,
  title = {{Non-aware computable presentations of randomizations}},
  author = {Xuanheng Zhao},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.30569},
  eprint = {2610.30569},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.30569},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Non-aware computable presentations of randomizations
AU  - Xuanheng Zhao
PY  - 2026
DA  - 2026/10/22
PB  - arXiv
DO  - 10.48550/arxiv.2610.30569
UR  - https://arxiv.org/abs/2610.30569
AB  - Let 2 be the two-element structure in the empty signature. We build a computable presentation Q of the Borel randomization 2^[0,1) in which neither constant random variable is a computable point. Consequently, Q is not aware. This gives a negative answer to a question of Cuervo Ovalle and Goldbring \cite{CG}. We also construct a countable structure M with no computable presentation but M^[0,1) has a computable presentation. This answers another question and establishes the necessity of the awareness condition stated in one of the main theorems in \cite{CG}.
ER  -