✦ LIBER ✦

On Schnorr and computable randomness, martingales, and machines

✍ Scribed by Rod Downey; Evan Griffiths; Geoffrey Laforte

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 269 KB
Volume: 50
Category: Article
ISSN: 0044-3050
DOI: 10.1002/malq.200310121

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

📜 SIMILAR VOLUMES

Truth-table Schnorr randomness and truth

Truth-table Schnorr randomness and truth-table reducible randomness

✍ Kenshi Miyabe 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 172 KB

Schnorr randomness and computable randomness are natural concepts of random sequences. However van Lambalgen's Theorem fails for both randomnesses. In this paper we define truth-table Schnorr randomness (defined in [6] too only by martingales) and truth-table reducible randomness, for which we prove

Fuzzy Random Variables, Expectation, and

Fuzzy Random Variables, Expectation, and Martingales

✍ M. Stojakovic 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 357 KB

On conformal martingale diffusions and p

On conformal martingale diffusions and pluripolar sets

✍ M Fukushima; M Okada 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 564 KB

On Effectively Computable Operators

✍ John P. Helm 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 886 KB

Computing machines and the patterns of r

Computing machines and the patterns of research

📂 Article 📅 1957 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 105 KB

Computable operators on regular sets

✍ Martin Ziegler 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB

## Abstract For regular sets in Euclidean space, previous work has identified twelve ‘basic’ computability notions to (pairs of) which many previous notions considered in literature were shown to be equivalent. With respect to those basic notions we now investigate on the computability of natural o