RECOGNIZING STRONG RANDOM REALS-Reference-Cited by-同舟云学术

RECOGNIZING STRONG RANDOM REALS

Published:2008-06 Issue:1 Volume:1 Page:56-63
ISSN:1755-0203
Container-title:The Review of Symbolic Logic
language:en
Short-container-title:Rev. symb. logic

Author:

OSHERSON DANIEL,WEINSTEIN SCOTT

Abstract

The class of strong random reals can be defined via a natural conception of effective null set. We show that the same class is also characterized by a learning-theoretic criterion of ‘recognizability’.

Publisher

Cambridge University Press (CUP)

Subject

Logic,Philosophy,Mathematics (miscellaneous)

Reference23 articles.

1. Weakly Computable Real Numbers

2. Lieb E. H. , Osherson D. , & Weinstein S . (2006). Elementary proof of a theorem of Jean Ville. Available online from: http:arxiv.org/PS_cache/cs/pdf/0607/0607054.pdf.

3. Trial and error predicates and the solution to a problem of Mostowski

4. Process complexity and effective random tests

5. Can an individual sequence of zeros and ones be random?

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. From Wald to Schnorr: von Mises’ definition of randomness in the aftermath of Ville’s Theorem;Studies in History and Philosophy of Science;2024-08

2. UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS;The Bulletin of Symbolic Logic;2022-05-02

3. A NOTE ON THE LEARNING-THEORETIC CHARACTERIZATIONS OF RANDOMNESS AND CONVERGENCE;The Review of Symbolic Logic;2021-03-22

4. The Equivalence of Definitions of Algorithmic Randomness†;Philosophia Mathematica;2021-02-22

5. A LEARNING-THEORETIC CHARACTERISATION OF MARTIN-LÖF RANDOMNESS AND SCHNORR RANDOMNESS;The Review of Symbolic Logic;2019-11-04