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

Source URL: www.vovk.net

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

Source URL: www.math.tau.ac.il

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.

Source URL: www.statslab.cam.ac.uk

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

Source URL: www.literateprogramming.com

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

Source URL: pr.cs.cornell.edu

The scaling window for a random graph with a given degree sequence Hamed Hatami and Michael Molloy∗ Department of Computer Science University of Toronto e-mail: ,

Source URL: www.cs.toronto.edu

CrossMark_Color_Stacked_p

Source URL: debut.cis.nctu.edu.tw

• Software
• Tetris
• Gaming
• Digital media
• Random number generation
• Steganography
• Public-key cryptography
• Puzzle video game
• Easter egg
• Random sequence
• Transmission Control Protocol

Powerpoint-presentation Information and Computing Sciences

Source URL: usefulpatterns.org

• Theoretical computer science
• Theory of computation
• Algorithmic information theory
• Computability theory
• Academia
• Randomness
• Turing machine
• Kolmogorov complexity
• Algorithmically random sequence
• Algorithmic probability
• Minimum description length
• Complexity

From Discrepancy to Declustering: Near-optimal multidimensional declustering strategies for range queries [Extended Abstract] Chung-Min Chen

Source URL: www.cs.uwm.edu

• Mathematics
• Mathematical analysis
• Diophantine approximation
• Low-discrepancy sequence
• Numerical analysis
• Quasirandomness
• Random number generation
• Ring
• Permutation
• Maximum disjoint set
• Permutation polynomial

Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton Scott Aaronson∗ Sean M. Carroll†

Source URL: www.scottaaronson.com

• Information theory
• Randomness
• Metaphysics
• Theoretical computer science
• Theory of computation
• Entropy
• Kolmogorov complexity
• Sophistication
• Complexity
• Random sequence
• Algorithmic information theory
• Mutual information