DOCSLIB.ORG

Kolmogorov Complexity

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Kolmogorov Complexity Kolmogorov Complexity Pei Wang Kolmogorov Complexity Pei Wang School of Mathematical Sciences Peking University [email protected] May 15, 2012 Kolmogorov Outline Complexity Pei Wang Definition Models of Computation Definition Models of Computation Definitions Definitions Examples Examples Kolmogorov Complexity and Kolmogorov Complexity and Entropy Entropy Prefix Code Kolmogorov Complexity and Prefix Code Entropy Kolmogorov Complexity and Entropy Algorithmically Random and Incompressible Algorithmically Random and Incompressible Random and Incompressible Random and Incompressible Asymptotic Equipartition Property A Random Bernoulli Asymptotic Equipartition Property Sequence A Random Bernoulli Sequence Ω Kolmogorov Ω Complexity and Universal Kolmogorov Complexity and Universal Probability Probability Summary Summary References Kolmogorov A Turing Machine Complexity Pei Wang I a finite-state machine operating on a finite symbol set, Definition Models of Computation I at each unit of time, the machine inspects the Definitions program tape, writes some symbols on a work tape, Examples Kolmogorov changes its state according to its transition table, and Complexity and Entropy calls for more program. Prefix Code Kolmogorov Complexity and I reads from left to right only. Entropy Algorithmically Random and Incompressible Random and Incompressible Asymptotic Equipartition Property A Random Bernoulli Sequence Ω Kolmogorov Complexity and Universal Probability Figure: A Turing Machine Summary References Most of the materials is copy-edited from[Cover et al., 1991]. Kolmogorov A Turing Machine Complexity Pei Wang I a finite-state machine operating on a finite symbol set, Definition Models of Computation I at each unit of time, the machine inspects the Definitions program tape, writes some symbols on a work tape, Examples Kolmogorov changes its state according to its transition table, and Complexity and Entropy calls for more program. Prefix Code Kolmogorov Complexity and I reads from left to right only. Entropy Algorithmically Random and Incompressible Random and Incompressible Asymptotic Equipartition Property A Random Bernoulli Sequence Ω Kolmogorov Complexity and Universal Probability Figure: A Turing Machine Summary References Most of the materials is copy-edited from[Cover et al., 1991]. Kolmogorov A Turing Machine Complexity Pei Wang I a finite-state machine operating on a finite symbol set, Definition Models of Computation I at each unit of time, the machine inspects the Definitions program tape, writes some symbols on a work tape, Examples Kolmogorov changes its state according to its transition table, and Complexity and Entropy calls for more program. Prefix Code Kolmogorov Complexity and I reads from left to right only. Entropy Algorithmically Random and Incompressible Random and Incompressible Asymptotic Equipartition Property A Random Bernoulli Sequence Ω Kolmogorov Complexity and Universal Probability Figure: A Turing Machine Summary References Most of the materials is copy-edited from[Cover et al., 1991]. Kolmogorov A Turing Machine Complexity Pei Wang Definition I The programs this Turing Machine reads form a Models of Computation Definitions prefix-free set: Examples I no program leading to a halting computation can be Kolmogorov Complexity and the prefix of another such program. Entropy Prefix Code Kolmogorov Complexity and I We can view the Turing machine as a map: Entropy Algorithmically I from a set of finite-length binary strings to the set of Random and finite- or infinite-length binary strings, Incompressible Random and Incompressible I The computation may halt or not. Asymptotic Equipartition Property A Random Bernoulli Sequence Definition Ω ∗ ∗ 1 The set of functions f : f0; 1g ! f0; 1g [ f0; 1g Kolmogorov Complexity and computable by Turing machines is called the set of Universal partial recursive functions . Probability Summary References Kolmogorov A Turing Machine Complexity Pei Wang Definition I The programs this Turing Machine reads form a Models of Computation Definitions prefix-free set: Examples I no program leading to a halting computation can be Kolmogorov Complexity and the prefix of another such program. Entropy Prefix Code Kolmogorov Complexity and I We can view the Turing machine as a map: Entropy Algorithmically I from a set of finite-length binary strings to the set of Random and finite- or infinite-length binary strings, Incompressible Random and Incompressible I The computation may halt or not. Asymptotic Equipartition Property A Random Bernoulli Sequence Definition Ω ∗ ∗ 1 The set of functions f : f0; 1g ! f0; 1g [ f0; 1g Kolmogorov Complexity and computable by Turing machines is called the set of Universal partial recursive functions . Probability Summary References Kolmogorov A Turing Machine Complexity Pei Wang Definition I The programs this Turing Machine reads form a Models of Computation Definitions prefix-free set: Examples I no program leading to a halting computation can be Kolmogorov Complexity and the prefix of another such program. Entropy Prefix Code Kolmogorov Complexity and I We can view the Turing machine as a map: Entropy Algorithmically I from a set of finite-length binary strings to the set of Random and finite- or infinite-length binary strings, Incompressible Random and Incompressible I The computation may halt or not. Asymptotic Equipartition Property A Random Bernoulli Sequence Definition Ω ∗ ∗ 1 The set of functions f : f0; 1g ! f0; 1g [ f0; 1g Kolmogorov Complexity and computable by Turing machines is called the set of Universal partial recursive functions . Probability Summary References Kolmogorov A Turing Machine Complexity Pei Wang Definition I The programs this Turing Machine reads form a Models of Computation Definitions prefix-free set: Examples I no program leading to a halting computation can be Kolmogorov Complexity and the prefix of another such program. Entropy Prefix Code Kolmogorov Complexity and I We can view the Turing machine as a map: Entropy Algorithmically I from a set of finite-length binary strings to the set of Random and finite- or infinite-length binary strings, Incompressible Random and Incompressible I The computation may halt or not. Asymptotic Equipartition Property A Random Bernoulli Sequence Definition Ω ∗ ∗ 1 The set of functions f : f0; 1g ! f0; 1g [ f0; 1g Kolmogorov Complexity and computable by Turing machines is called the set of Universal partial recursive functions . Probability Summary References Kolmogorov A Turing Machine Complexity Pei Wang Definition I The programs this Turing Machine reads form a Models of Computation Definitions prefix-free set: Examples I no program leading to a halting computation can be Kolmogorov Complexity and the prefix of another such program. Entropy Prefix Code Kolmogorov Complexity and I We can view the Turing machine as a map: Entropy Algorithmically I from a set of finite-length binary strings to the set of Random and finite- or infinite-length binary strings, Incompressible Random and Incompressible I The computation may halt or not. Asymptotic Equipartition Property A Random Bernoulli Sequence Definition Ω ∗ ∗ 1 The set of functions f : f0; 1g ! f0; 1g [ f0; 1g Kolmogorov Complexity and computable by Turing machines is called the set of Universal partial recursive functions . Probability Summary References Kolmogorov A Turing Machine Complexity Pei Wang Definition I The programs this Turing Machine reads form a Models of Computation Definitions prefix-free set: Examples I no program leading to a halting computation can be Kolmogorov Complexity and the prefix of another such program. Entropy Prefix Code Kolmogorov Complexity and I We can view the Turing machine as a map: Entropy Algorithmically I from a set of finite-length binary strings to the set of Random and finite- or infinite-length binary strings, Incompressible Random and Incompressible I The computation may halt or not. Asymptotic Equipartition Property A Random Bernoulli Sequence Definition Ω ∗ ∗ 1 The set of functions f : f0; 1g ! f0; 1g [ f0; 1g Kolmogorov Complexity and computable by Turing machines is called the set of Universal partial recursive functions . Probability Summary References Kolmogorov Turing Machine Complexity Pei Wang Definition Models of Computation Definitions I Turing argued that this machine could mimic the Examples computational ability of a human being. Kolmogorov Complexity and Entropy I After Turing’s work, it turned out that every new Prefix Code Kolmogorov Complexity and computational system could be reduced to a Turing Entropy Algorithmically machine, and conversely. Random and Incompressible Random and I In particular,the familiar digital computer with its Incompressible Asymptotic Equipartition CPU, memory, and input output devices could be Property A Random Bernoulli simulated by and could simulate a Turing machine. Sequence Ω Kolmogorov Complexity and Universal Probability Summary References Kolmogorov Turing Machine Complexity Pei Wang Definition Models of Computation Definitions I Turing argued that this machine could mimic the Examples computational ability of a human being. Kolmogorov Complexity and Entropy I After Turing’s work, it turned out that every new Prefix Code Kolmogorov Complexity and computational system could be reduced to a Turing Entropy Algorithmically machine, and conversely. Random and Incompressible Random and I In particular,the familiar digital computer with its Incompressible Asymptotic Equipartition CPU, memory, and input output devices could be Property A Random Bernoulli simulated by and could simulate a Turing machine. Sequence Ω Kolmogorov Complexity
Load more

Recommended publications
  • Lecture 24 1 Kolmogorov Complexity
    6.441 Spring 2006 24-1 6.441 Transmission of Information May 18, 2006 Lecture 24 Lecturer: Madhu Sudan Scribe: Chung Chan 1 Kolmogorov complexity Shannon’s notion of compressibility is closely tied to a probability distribution. However, the probability distribution of the source is often unknown to the encoder. Sometimes, we interested in compressibility of specific sequence. e.g. How compressible is the Bible? We have the Lempel-Ziv universal compression algorithm that can compress any string without knowledge of the underlying probability except the assumption that the strings comes from a stochastic source. But is it the best compression possible for each deterministic bit string? This notion of compressibility/complexity of a deterministic bit string has been studied by Solomonoff in 1964, Kolmogorov in 1966, Chaitin in 1967 and Levin. Consider the following n-sequence 0100011011000001010011100101110111 ··· Although it may appear random, it is the enumeration of all binary strings. A natural way to compress it is to represent it by the procedure that generates it: enumerate all strings in binary, and stop at the n-th bit. The compression achieved in bits is |compression length| ≤ 2 log n + O(1) More generally, with the universal Turing machine, we can encode data to a computer program that generates it. The length of the smallest program that produces the bit string x is called the Kolmogorov complexity of x. Definition 1 (Kolmogorov complexity) For every language L, the Kolmogorov complexity of the bit string x with respect to L is KL (x) = min l(p) p:L(p)=x where p is a program represented as a bit string, L(p) is the output of the program with respect to the language L, and l(p) is the length of the program, or more precisely, the point at which the execution halts.
    [Show full text]
  • Shannon Entropy and Kolmogorov Complexity
    Information and Computation: Shannon Entropy and Kolmogorov Complexity Satyadev Nandakumar Department of Computer Science. IIT Kanpur October 19, 2016 This measures the average uncertainty of X in terms of the number of bits. Shannon Entropy Definition Let X be a random variable taking finitely many values, and P be its probability distribution. The Shannon Entropy of X is X 1 H(X ) = p(i) log : 2 p(i) i2X Shannon Entropy Definition Let X be a random variable taking finitely many values, and P be its probability distribution. The Shannon Entropy of X is X 1 H(X ) = p(i) log : 2 p(i) i2X This measures the average uncertainty of X in terms of the number of bits. The Triad Figure: Claude Shannon Figure: A. N. Kolmogorov Figure: Alan Turing Just Electrical Engineering \Shannon's contribution to pure mathematics was denied immediate recognition. I can recall now that even at the International Mathematical Congress, Amsterdam, 1954, my American colleagues in probability seemed rather doubtful about my allegedly exaggerated interest in Shannon's work, as they believed it consisted more of techniques than of mathematics itself. However, Shannon did not provide rigorous mathematical justification of the complicated cases and left it all to his followers. Still his mathematical intuition is amazingly correct." A. N. Kolmogorov, as quoted in [Shi89]. Kolmogorov and Entropy Kolmogorov's later work was fundamentally influenced by Shannon's. 1 Foundations: Kolmogorov Complexity - using the theory of algorithms to give a combinatorial interpretation of Shannon Entropy. 2 Analogy: Kolmogorov-Sinai Entropy, the only finitely-observable isomorphism-invariant property of dynamical systems.
    [Show full text]
  • Information Theory
    Information Theory Professor John Daugman University of Cambridge Computer Science Tripos, Part II Michaelmas Term 2016/17 H(X,Y) I(X;Y) H(X|Y) H(Y|X) H(X) H(Y) 1 / 149 Outline of Lectures 1. Foundations: probability, uncertainty, information. 2. Entropies defined, and why they are measures of information. 3. Source coding theorem; prefix, variable-, and fixed-length codes. 4. Discrete channel properties, noise, and channel capacity. 5. Spectral properties of continuous-time signals and channels. 6. Continuous information; density; noisy channel coding theorem. 7. Signal coding and transmission schemes using Fourier theorems. 8. The quantised degrees-of-freedom in a continuous signal. 9. Gabor-Heisenberg-Weyl uncertainty relation. Optimal \Logons". 10. Data compression codes and protocols. 11. Kolmogorov complexity. Minimal description length. 12. Applications of information theory in other sciences. Reference book (*) Cover, T. & Thomas, J. Elements of Information Theory (second edition). Wiley-Interscience, 2006 2 / 149 Overview: what is information theory? Key idea: The movements and transformations of information, just like those of a fluid, are constrained by mathematical and physical laws. These laws have deep connections with: I probability theory, statistics, and combinatorics I thermodynamics (statistical physics) I spectral analysis, Fourier (and other) transforms I sampling theory, prediction, estimation theory I electrical engineering (bandwidth; signal-to-noise ratio) I complexity theory (minimal description length) I signal processing, representation, compressibility As such, information theory addresses and answers the two fundamental questions which limit all data encoding and communication systems: 1. What is the ultimate data compression? (answer: the entropy of the data, H, is its compression limit.) 2.
    [Show full text]
  • A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications
    Special Publication 800-22 Revision 1a A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications AndrewRukhin,JuanSoto,JamesNechvatal,Miles Smid,ElaineBarker,Stefan Leigh,MarkLevenson,Mark Vangel,DavidBanks,AlanHeckert,JamesDray,SanVo Revised:April2010 LawrenceE BasshamIII A Statistical Test Suite for Random and Pseudorandom Number Generators for NIST Special Publication 800-22 Revision 1a Cryptographic Applications 1 2 Andrew Rukhin , Juan Soto , James 2 2 Nechvatal , Miles Smid , Elaine 2 1 Barker , Stefan Leigh , Mark 1 1 Levenson , Mark Vangel , David 1 1 2 Banks , Alan Heckert , James Dray , 2 San Vo Revised: April 2010 2 Lawrence E Bassham III C O M P U T E R S E C U R I T Y 1 Statistical Engineering Division 2 Computer Security Division Information Technology Laboratory National Institute of Standards and Technology Gaithersburg, MD 20899-8930 Revised: April 2010 U.S. Department of Commerce Gary Locke, Secretary National Institute of Standards and Technology Patrick Gallagher, Director A STATISTICAL TEST SUITE FOR RANDOM AND PSEUDORANDOM NUMBER GENERATORS FOR CRYPTOGRAPHIC APPLICATIONS Reports on Computer Systems Technology The Information Technology Laboratory (ITL) at the National Institute of Standards and Technology (NIST) promotes the U.S. economy and public welfare by providing technical leadership for the nation’s measurement and standards infrastructure. ITL develops tests, test methods, reference data, proof of concept implementations, and technical analysis to advance the development and productive use of information technology. ITL’s responsibilities include the development of technical, physical, administrative, and management standards and guidelines for the cost-effective security and privacy of sensitive unclassified information in Federal computer systems.
    [Show full text]
  • Paper 1 Jian Li Kolmold
    KolmoLD: Data Modelling for the Modern Internet* Dmitry Borzov, Huawei Canada Tim Tingqiu Yuan, Huawei Mikhail Ignatovich, Huawei Canada Jian Li, Futurewei *work performed before May 2019 Challenges: Peak Traffic Composition 73% 26% Content: sizable, faned-out, static Streaming Services Everything else (Netflix, Hulu, Software File storage (Instant Messaging, YouTube, Spotify) distribution services VoIP, Social Media) [1] Source: Sandvine Global Internet Phenomena reports for 2009, 2010, 2011, 2012, 2013, 2015, 2016, October 2018 [1] https://qz.com/1001569/the-cdn-heavy-internet-in-rich-countries-will-be-unrecognizable-from-the-rest-of-the-worlds-in-five-years/ Technologies to define the revolution of the internet ChunkStream Founded in 2016 Video codec Founded in 2014 Content-addressable Based on a 2014 MIT Browser-targeted Runtime Content-addressable network protocol based research paper network protocol based on cryptohash naming on cryptohash naming scheme Implemented and supported by all major scheme Based on the Open source project cryptohash naming browsers, an IETF standard Founding company is a P2P project scheme YCombinator graduate YCombinator graduate with backing of high profile SV investors Our Proposal: A data model for interoperable protocols KolmoLD Content addressing through hashes has become a widely-used means of Addressable: connecting layer, inspired by connecting data in distributed the principles of Kolmogorov complexity systems, from the blockchains that theory run your favorite cryptocurrencies, to the commits that back your code, to Compossible: sending data as code, where the web’s content at large. code efficiency is theoretically bounded by Kolmogorov complexity Yet, whilst all of these tools rely on Computable: sandboxed computability by some common primitives, their treating data as code specific underlying data structures are not interoperable.
    [Show full text]
  • Maximizing T-Complexity 1. Introduction
    Fundamenta Informaticae XX (2015) 1–19 1 DOI 10.3233/FI-2012-0000 IOS Press Maximizing T-complexity Gregory Clark U.S. Department of Defense gsclark@ tycho. ncsc. mil Jason Teutsch Penn State University teutsch@ cse. psu. edu Abstract. We investigate Mark Titchener’s T-complexity, an algorithm which measures the infor- mation content of finite strings. After introducing the T-complexity algorithm, we turn our attention to a particular class of “simple” finite strings. By exploiting special properties of simple strings, we obtain a fast algorithm to compute the maximum T-complexity among strings of a given length, and our estimates of these maxima show that T-complexity differs asymptotically from Kolmogorov complexity. Finally, we examine how closely de Bruijn sequences resemble strings with high T- complexity. 1. Introduction How efficiently can we generate random-looking strings? Random strings play an important role in data compression since such strings, characterized by their lack of patterns, do not compress well. For prac- tical compression applications, compression must take place in a reasonable amount of time (typically linear or nearly linear time). The degree of success achieved with the classical compression algorithms of Lempel and Ziv [9, 21, 22] and Welch [19] depend on the complexity of the input string; the length of the compressed string gives a measure of the original string’s complexity. In the same monograph in which Lempel and Ziv introduced the first of these algorithms [9], they gave an example of a succinctly describable class of strings which yield optimally poor compression up to a logarithmic factor, namely the class of lexicographically least de Bruijn sequences for each length.
    [Show full text]
  • Finite Automata and Random Sequence
    Finite Automata and Random Sequence C. P. Schnorr and H. Stimm Institut für Angewandte mathematick der Johann Wolfgang Goethe-Universiät D-6000 Frankfurt 1, Robert-Mayer-Str. 10 Bundesrepublik Deutschland Abstract. We consider the behaviour of finite automata on infinite bi- nary sequence and study the class of random tests which can be carried out by finite automata. We give several equivalent characterizations of those infinite binary sequences which are random relative to finite au- tomata. These characterizations are based on the concepts of selection rules, martingales and invariance properties defined by finite automata. 1 Introduction Stimulated by Kolmogorov and and Chaitin, several attempts have been made recently, by Martin-Löf, Loveland, and Schnorr, to conceive the notion of infinite binary random sequences on the basis of the theory of algorithms. In Schnorr [13] an intuitive concept of the effective random test is proposed. The hitherto investigated, different approaches to this one has proven to be equivalent. It thus provides an robust definition of the notion of randomness. We say a sequence is random if it can pass any effective random test. Random sequences can not necessarily be calculated effectively, i. e., they are not recursive. The problem, which is important for the application, to calculate the possible “random” sequences can therefore only be investigated in the sense that random sequences can be approximated by recursive sequences. Recursive sequences that behave “random” are called pseudo-random sequences. From a pseudo-random sequence one would expect that it at least fulfills the“most im- portant” probability laws. The assumption is that the algorithmically simple random tests correspond to particularly important probability laws.
    [Show full text]
  • 1952 Washington UFO Sightings • Psychic Pets and Pet Psychics • the Skeptical Environmentalist Skeptical Inquirer the MAGAZINE for SCIENCE and REASON Volume 26,.No
    1952 Washington UFO Sightings • Psychic Pets and Pet Psychics • The Skeptical Environmentalist Skeptical Inquirer THE MAGAZINE FOR SCIENCE AND REASON Volume 26,.No. 6 • November/December 2002 ppfjlffl-f]^;, rj-r ci-s'.n.: -/: •:.'.% hstisnorm-i nor mm . o THE COMMITTEE FOR THE SCIENTIFIC INVESTIGATION OF CLAIMS OF THE PARANORMAL AT THE CENTER FOR INQUIRY-INTERNATIONAL (ADJACENT TO THE STATE UNIVERSITY OF NEW YORK AT BUFFALO) • AN INTERNATIONAL ORGANIZATION Paul Kurtz, Chairman; professor emeritus of philosophy. State University of New York at Buffalo Barry Karr, Executive Director Joe Nickell, Senior Research Fellow Massimo Polidoro, Research Fellow Richard Wiseman, Research Fellow Lee Nisbet Special Projects Director FELLOWS James E. Alcock,* psychologist. York Univ., Consultants, New York. NY Irmgard Oepen, professor of medicine Toronto Susan Haack. Cooper Senior Scholar in Arts (retired), Marburg, Germany Jerry Andrus, magician and inventor, Albany, and Sciences, prof, of philosophy, University Loren Pankratz, psychologist, Oregon Health Oregon of Miami Sciences Univ. Marcia Angell, M.D., former editor-in-chief. C. E. M. Hansel, psychologist. Univ. of Wales John Paulos, mathematician, Temple Univ. New England Journal of Medicine Al Hibbs, scientist, Jet Propulsion Laboratory Steven Pinker, cognitive scientist, MIT Robert A. Baker, psychologist. Univ. of Douglas Hofstadter, professor of human Massimo Polidoro, science writer, author, Kentucky understanding and cognitive science, executive director CICAP, Italy Stephen Barrett, M.D., psychiatrist, author. Indiana Univ. Milton Rosenberg, psychologist, Univ. of consumer advocate, Allentown, Pa. Gerald Holton, Mallinckrodt Professor of Chicago Barry Beyerstein,* biopsychologist, Simon Physics and professor of history of science, Wallace Sampson, M.D., clinical professor of Harvard Univ. Fraser Univ., Vancouver, B.C., Canada medicine, Stanford Univ., editor, Scientific Ray Hyman.* psychologist, Univ.
    [Show full text]
  • Marion REVOLLE
    Algorithmic information theory for automatic classification Marion Revolle, [email protected] Nicolas le Bihan, [email protected] Fran¸cois Cayre, [email protected] Main objective Files : any byte string in a computer (text, music, ..) & Similarity measure in a non-probabilist context : Similarity metric Algorithmic information theory : Kolmogorov complexity % 1.1 Complexity 1.2 GZIP 1.3 Examples GZIP : compression algorithm = DEFLATE + Huffman. Given x a file string of size jxj define on the alphabet Ax A- x = ABCA BCCB CABC of size αx. A- DEFLATE L(x) = 6 Z(-1! 1) A- Simple complexity Dictionary compression based on LZ77 : make ref- x : L(A) L(B) L(C) Z(-3!3) L(C) Z(-6!5) K(x) : Kolmogorov complexity : the length of a erences from the past. ABC ABCC BCABC shortest binary program to compute x. B- y = ABCA BCAB CABC DEFLATE(x) generate two kinds of symbol : L(x) : Lempel-Ziv complexity : the minimal number L(y) = 5 of operations making insert/copy from x's past L(a) : insert the element a in Ax = Literal. y : L(A) L(B) L(C) Z(-3!3) Z(-6!6) to generate x. Z(-i ! j) : paste j elements, i elements before = Refer- ABC ABC ABCABC ence of length j. L(yjx) = 2 yjx : Z(-12!6) Z(-12!6) B- Conditional complexity ABCABC ABCABC K(xjy) : conditional Kolmogorov complexity : the B- Complexity C- z = MNOM NOMN OMNO length of a shortest binary program to compute Number of symbols to compress x with DEFLATE L(z) = 5 x is y is furnished as an auxiliary input.
    [Show full text]
  • On One-Way Functions and Kolmogorov Complexity
    On One-way Functions and Kolmogorov Complexity Yanyi Liu Rafael Pass∗ Cornell University Cornell Tech [email protected] [email protected] September 24, 2020 Abstract We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial t(n) ≥ (1 + ")n; " > 0, the following are equivalent: • One-way functions exists (which in turn is equivalent to the existence of secure private-key encryption schemes, digital signatures, pseudorandom generators, pseudorandom functions, commitment schemes, and more); • t-time bounded Kolmogorov Complexity, Kt, is mildly hard-on-average (i.e., there exists a t 1 polynomial p(n) > 0 such that no PPT algorithm can compute K , for more than a 1 − p(n) fraction of n-bit strings). In doing so, we present the first natural, and well-studied, computational problem characterizing the feasibility of the central private-key primitives and protocols in Cryptography. ∗Supported in part by NSF Award SATC-1704788, NSF Award RI-1703846, AFOSR Award FA9550-18-1-0267, and a JP Morgan Faculty Award. This research is based upon work supported in part by the Office of the Director of National Intelligence (ODNI), Intelligence Advanced Research Projects Activity (IARPA), via 2019-19-020700006. The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies, either expressed or implied, of ODNI, IARPA, or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for governmental purposes notwithstanding any copyright annotation therein. 1 Introduction We prove the equivalence of two fundamental problems in the theory of computing: (a) the exis- tence of one-way functions, and (b) mild average-case hardness of the time-bounded Kolmogorov Complexity problem.
    [Show full text]
  • Complexity Measurement Based on Information Theory and Kolmogorov Complexity
    Leong Ting Lui** Complexity Measurement Based † Germán Terrazas on Information Theory and University of Nottingham Kolmogorov Complexity ‡ Hector Zenil University of Sheffield Cameron Alexander§ University of Nottingham Natalio Krasnogor*,¶ Abstract In the past decades many definitions of complexity Newcastle University have been proposed. Most of these definitions are based either on Shannonʼs information theory or on Kolmogorov complexity; these two are often compared, but very few studies integrate the two ideas. In this article we introduce a new measure of complexity that builds on both of these theories. As a demonstration of the concept, the technique is applied to elementary cellular automata Keywords and simulations of the self-organization of porphyrin molecules. Complex systems, measures of complexity, open-ended evolution, cellular automata, molecular computation 1 Introduction The notion of complexity has been used in various disciplines. However, the very definition of complexity1 is still without consensus. One of the reasons for this is that there are many intuitive interpretations to the concept of complexity that can be applied in different domains of science. For instance, the Lorentz attractor can be simply described by three interaction differential equations, but it is often seen as producing complex chaotic dynamics. The iconic fractal image generated by the Mandelbrot set can be seen as a simple mathematical algorithm having a com- plex phase diagram. Yet another characteristic of complex systems is that they consist of many interacting components such as genetic regulatory networks, electronic components, and ecological food chains. Complexity is also associated with processes that generate complex outcomes, evolution being the best example.
    [Show full text]
  • Kolmogorov Complexity and Its Applications
    CHAPTER 4 Kolmogorov Complexity and its Applications Ming LI Aiken Computation Laboratory, Han•ard University, Cambridge, MA 02138, USA Paul M.B. VIT ANYI Centrum voor Wiskunde en biformatica, Kruislaan 413, 1098 SJ Amsterdam, Netherlands, and Facu/teit Wiskunde en Jnjormatica, Universiteic van Amsterdam, Amsterdam, Netherlands Contents L Introduction 189 2. Mathematical theory 196 3. Applications of compressibility 214 4. Example of an application in mathematics: weak prime number theorems. 221 5. Applications of incompressibility: proving lower bounds 222 6. Resource-bounded Kolmogorov complexity and its applications 236 7. Conclusion 247 Acknowledgment 247 References :48 HANDBOOK OF THEORETICAL COMPUTER SCIENCE Edited by J. van Leeuwen ((' Elsevier Science Publishers B.V., 1990 KOLMOGOROV COMPLEXITY AND ITS APPLICATIONS 189 t. Introduction In everyday language we identify the information in an individual object with the essentials of a description for it. We can formalize this by defining the amount of information in a finite object (like a string) as the size (i.e., number of bits) of the smallest program that, starting with a blank memory, outputs the string and then terminates. A similar definition can be given for infinite strings, but in this case the program produces element after element forever. Thus, 1n (a string of nones) contains little information because a program of size about log n outputs it (like "print n ls"). Likewise, the transcendental number rr = 3.1415 ... , an infinite sequence of seemingly "random" decimal digits, contains O(l) information. (There is a short program that produces the consecutive digits of rr forever.) Such a definition would appear to make the amount of information in a string depend on the particular programming language used.
    [Show full text]