<--- Back to Details
First PageDocument Content
Computability theory / Theory of computation / Randomness / Theoretical computer science / Algorithmic information theory / Kolmogorov complexity / Algorithmically random sequence / Computable function / Complexity / Algorithm / Pseudorandomness / Lossless compression
Date: 2012-10-07 04:35:37
Computability theory
Theory of computation
Randomness
Theoretical computer science
Algorithmic information theory
Kolmogorov complexity
Algorithmically random sequence
Computable function
Complexity
Algorithm
Pseudorandomness
Lossless compression

Applied Mathematics and Computation xxxxxx–xxx Contents lists available at ScienceDirect Applied Mathematics and Computation journal homepage: www.elsevier.com/locate/amc

Add to Reading List

Source URL: scribblethink.org

Download Document from Source Website

File Size: 668,80 KB

Share Document on Facebook

Similar Documents

Coarse Geometry and Randomness Itai Benjamini October 30, 2013 Contents 1 Introductory graph and metric notions

Coarse Geometry and Randomness Itai Benjamini October 30, 2013 Contents 1 Introductory graph and metric notions

DocID: 1xW27 - View Document

Lecture 15, Thurs March 9: Einstein-Certified Randomness Until recently, the Bell inequality was taught because it was historically and conceptually important, not because it had any practical applications. Sure, it esta

Lecture 15, Thurs March 9: Einstein-Certified Randomness Until recently, the Bell inequality was taught because it was historically and conceptually important, not because it had any practical applications. Sure, it esta

DocID: 1xV1Y - View Document

Non-randomness in eSTREAM Candidates Salsa20 and TSC-4 Simon Fischer1 , Willi Meier1 , Cˆ ome Berbain , Jean-Fran¸cois Biasse2 , and M.J.B. Robshaw2 2

Non-randomness in eSTREAM Candidates Salsa20 and TSC-4 Simon Fischer1 , Willi Meier1 , Cˆ ome Berbain , Jean-Fran¸cois Biasse2 , and M.J.B. Robshaw2 2

DocID: 1xUnW - View Document

COSC 544 Probabilistic Proof SystemsThe Power of Randomness: Fingerprinting and Freivalds’ Algorithm Lecturer: Justin Thaler

COSC 544 Probabilistic Proof SystemsThe Power of Randomness: Fingerprinting and Freivalds’ Algorithm Lecturer: Justin Thaler

DocID: 1xT7p - View Document

Randomness vs. Time: De-randomization under a uniform assumption Russell Impagliazzo∗ Department of Computer Science University of California San Diego, CA

Randomness vs. Time: De-randomization under a uniform assumption Russell Impagliazzo∗ Department of Computer Science University of California San Diego, CA

DocID: 1vs6Y - View Document