<--- Back to Details
First PageDocument Content
Theory of computation / Mathematical logic / Randomness / Computable number / Algorithmically random sequence / Computable function / Random sequence / Measure-preserving dynamical system / Algorithmic information theory / Theoretical computer science / Computability theory / Mathematics
Date: 2009-04-16 08:57:17
Theory of computation
Mathematical logic
Randomness
Computable number
Algorithmically random sequence
Computable function
Random sequence
Measure-preserving dynamical system
Algorithmic information theory
Theoretical computer science
Computability theory
Mathematics

Add to Reading List

Source URL: www.loria.fr

Download Document from Source Website

File Size: 354,53 KB

Share Document on Facebook

Similar Documents

V. G. VOVK ON A CRITERION OF RANDOMNESS (Communicated by Academician A. N. Kolmogorov, This work belongs to algorithmic information theory (seeTheorem 1 shows that if some sequence is random with resp

DocID: 1uGQs - View Document

Lecture notes on Spatial Random Permutations Ron Peled∗ June 7, 2015 Abstract These notes accompany a sequence of lectures given at the Warsaw Probability

DocID: 1uAsy - View Document

Percolation and Random Walks on Graphs, MichaelmasExample Sheet 1 1. Let (an )n≥1 be a sequence of real numbers satisfying an+m ≤ an + am for all n, m ≥ 1.

DocID: 1uzB3 - View Document

Text-line Random Shuffling Program David R. Musser April 25, 2005 Abstract This short document presents a program that takes as input any sequence of items formatted one item per line and outputs the sequence

DocID: 1uzdK - View Document

Synthesizing Manipulation Sequences for Under-Specified Tasks using Unrolled Markov Random Fields Jaeyong Sung, Bart Selman and Ashutosh Saxena Abstract— Many tasks in human environments require performing a sequence o

DocID: 1tF3x - View Document