<--- Back to Details
First PageDocument Content
Mathematical analysis / Computability theory / Mathematics / Theory of computation / Theoretical computer science / Martingale theory / Stochastic processes / Kakeya set / Real analysis / Computable function / Martingale / Computable number
Date: 2014-07-23 19:14:22
Mathematical analysis
Computability theory
Mathematics
Theory of computation
Theoretical computer science
Martingale theory
Stochastic processes
Kakeya set
Real analysis
Computable function
Martingale
Computable number

Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡ Abstract

Add to Reading List

Source URL: paul.rutgers.edu

Download Document from Source Website

File Size: 323,22 KB

Share Document on Facebook

Similar Documents

arXiv:1512.03024v2 [cs.LO] 8 DecComparing representations for function spaces in computable analysis Arno Pauly

arXiv:1512.03024v2 [cs.LO] 8 DecComparing representations for function spaces in computable analysis Arno Pauly

DocID: 1sRZe - View Document

A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi

A brief introduction to Higher Order Logic and the HOL proof assistant Monica Nesi

DocID: 1rjEK - View Document

Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡  Abstract

Lines Missing Every Random Point∗ Jack H. Lutz† Neil Lutz‡ Abstract

DocID: 1qlxM - View Document

PDF Document

DocID: 1pZ37 - View Document

A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009

A computable axiomatisation of the topology of R and C Paul Taylor 6 August 2009

DocID: 1pMn0 - View Document