On approximate decidability of minimal programs 1
|
|
- Harriet Tyler
- 5 years ago
- Views:
Transcription
1 On approximate decidability of minimal programs 1 Jason Teutsch June 12, Joint work with Marius Zimand
2 How not to estimate complexity What s hard about Kolmogorov complexity? the case of functions tournaments Let C(x) denote Kolmogorov complexity. Definition A binary string x is called random if C(x) x. Sample results 1 No algorithm enumerates more than finitely many random strings. 2 No unbounded, computable function is a lower bound for Kolmgorov complexity (Zvonkin, Levin). 3 Any algorithm mapping a string to a list of values containing its Kolmogorov complexity must, for all but finitely many lengths n, include in the list for some string of length n at least a fixed fraction of the lengths below n + O(1) (Beigel, Buhrman, Fejer, Fortnow, Grabowski, Longpré, Muchnik, Stephan, Torenvliet).
3 How not to estimate complexity II What s hard about Kolmogorov complexity? the case of functions tournaments Marius and I investigated another form of approximation. Definition A set A is (m, k)-recursive if there exists a computable function f such that for any x 1 <... < x k, the k-bit vector f (x 1,..., x k ) agrees with the characteristic vector A(x 1,... x k ) in at least m places. Theorem (Teutsch, Zimand) The set of Kolmogorov random strings is not (1, k)-recursive for any k.
4 Short lists for strings What s hard about Kolmogorov complexity? the case of functions tournaments On the other hand, we have the following positive results. Theorem (Bauwens, Mahklin, Vereshchagin, Zimand 2013) There exists an algorithm which maps each binary string x to an O( x 2 )-size list containing a length C(x) + O(1) description for x. Theorem (Teutsch 2013) There exists a polynomial-time algorithm which maps each binary string x to a poly( x )-size list containing a length C(x) + O(1) description for x. Theorem (Bauwens, Zimand 2014) There exists a probabilistic algorithm which, for any positive δ < 1, maps each binary string x to a x -size list which contains a length C(x) + O[log( x /δ)] description for x with probability at least 1 δ. What happens at the semantic level?
5 Numberings obstacles What s hard about Kolmogorov complexity? the case of functions tournaments A numbering ϕ is a mapping e ϕ e such that the induced mapping e, x ϕ e (x) is partial-computable. Definition Let ϕ be a numbering. ϕ is computably bounded if for any further numbering ψ there exists a computable translation function f such that for any e, ϕ j = ψ e for some j f (e). A computably bounded numbering is said to have the Kolmogorov property if it admits a translation function which is bounded by a linear function. If we were to replace j f (e) with j = f (e) in the definition of computably bounded, we would obtain the usual Gödel numberings from computably theory.
6 Minimal indices obstacles What s hard about Kolmogorov complexity? the case of functions tournaments Definition For any numbering ϕ, let MIN ϕ = {e : ( j < e) [ϕ j ϕ e ]}, and let min ϕ (e) denote the unique index j MIN ϕ such that ϕ j = ϕ e. Blum (1967) showed that MIN ϕ is not computable for any Gödel numbering ϕ. In fact, Proposition (Teutsch, Zimand) For any computably bounded numbering ϕ, neither MIN ϕ nor min ϕ is computable. Schaefer (1998) asked whether there exists a positive integer k and a Gödel numbering ϕ such that MIN ϕ is (1, k)-recursive.
7 What s hard about Kolmogorov complexity? the case of functions tournaments Our results using the Kolmogorov property Theorem For any positive integer k and any numbering ϕ with the Kolmogorov property, MIN ϕ is not (1, k)-recursive. Theorem For every numbering ϕ with the Kolmogorov property and any computable function f which maps each index e to a list of indices containing min ϕ (e) we have f (e) = Ω(log 2 e) for infinitely many e. Theorem There exists a numbering ϕ with the Kolmogorov property such that if f is a computable function which maps each index e to a list of indices containing min ϕ (e) then f (e) = Ω(e) for infinitely many e.
8 Winner-goes-on tournaments What s hard about Kolmogorov complexity? the case of functions tournaments Suppose you are given two strings, one with low complexity, and one with high complexity. Can you tell which is which? Definition A set A is called semirecursive if there exists a computable function g such that if x A or y A, then g(x, y) A {x, y}. Proposition The set of random strings is not semirecursive. Proof. We run a winner-goes-on-tournament on the strings of length n, with the function g above deciding the winner of each match. Eventually we run out of new challengers, and g guarantees that the final winner is random. But we just described the final winner using log n + O(1) bits.
9 Bootstrapping obstacles What s hard about Kolmogorov complexity? the case of functions tournaments Proposition The set of random strings is not (1, 2)-recursive. Proof. Suppose that some computable function f : N N {L, H} witnesses that the set of random strings is (1, 2)-recursive, where H is the label for random and L is the label for nonrandom. Note that f (x, y) = (H, H) for at most finitely many pairs (x, y) (regardless of whether or not all but finitely many pairs satisfying f (x, y) = (H, H) are both random). Otherwise we could enumerate infinitely many random strings.
10 Bootstrapping II obstacles What s hard about Kolmogorov complexity? the case of functions tournaments Proof (cont.) Now the set of random strings is semirecursive via the computable function g defined as follows: if f (x, y) = (L, H), then g(x, y) = y, if f (x, y) = (H, L), then g(x, y) = x, if f (x, y) = (L, L), then g waits until one of the strings appears nonrandom and then chooses the other one, and if f (x, y) = (H, H), we hardwire a correct answer for g. Such a function g does not exist. Therefore the set of random strings is not (1, 2)-recursive. In order to go beyond (1, 2)-recursive, another kind of tournament is needed.
11 The arena method the arena method the champion method Bauwens game What do we do when the odds are not ever in our favor?
12 The arena method the arena method the champion method Bauwens game What do we do when the odds are not ever in our favor?
13 The arena method the arena method the champion method Bauwens game What do we do when the odds are not ever in our favor?
14 The arena method the arena method the champion method Bauwens game What do we do when the odds are not ever in our favor? Answer: We shrink the arena.
15 Shrinking the arena the arena method the champion method Bauwens game We wish to find simple sets containing high density of minimal indices. We do this as follows. 1 Focus on minimal indices for functions which converge only on input 0. Call this set M. 2 Sufficiently large intervals contain at least a constant fraction of indices from M by the Kolmogorov property. 3 For a sufficiently large interval I, consider the following sets: M I, programs in I that halt only on input 0 but are not minimal, and programs below max I which halt on input 0 and some other input. 4 Use nonuniform advice to guess approximate sizes for these sets, and use these approximations to construct a set that looks very similar to M I.
16 the arena method the champion method Bauwens game Density boosting with little advice Arena Lemma Let ϕ be a numbering with the Kolmogorov property, and let I n = {2 an + 1,..., 2 a(n+1) }. Then for every ɛ > 0 and n 0, there exists a subset A n I n such that 1 MIN ϕ A n (1 ɛ) A n, 2 C(A n n) O[log(1/ɛ)], and 3 A n = Ω( I n ). With respect to density, minimal indices behave almost like random strings.
17 The champion method the arena method the champion method Bauwens game A hat makes not a champion
18 Majority vote tournaments We outline the construction of champions. the arena method the champion method Bauwens game 1 Let f : N {H, L} be a computable function which labels integers as either high or low complexity. 2 Consider f restricted to a finite set A N. The champion is the least integer in A which f labels with H. 3 The complexity of the champion is at most C(A) + O(1), which is low. Therefore f makes a mistake. A more interesting case. When we generalize f to tuples of integers, we select champions by majority vote. Thus we enter the realm of (1, k)-recursive. If there are enough integers with high complexity in A, we can iteratively choose a second place champion, a third place champion, etc. The function f gets an entire tuple wrong.
19 Majority vote tournaments We outline the construction of champions. the arena method the champion method Bauwens game 1 Let f : N {H, L} be a computable function which labels integers as either high or low complexity. 2 Consider f restricted to a finite set A N. The champion is the least integer in A which f labels with H. 3 The complexity of the champion is at most C(A) + O(1), which is low. Therefore f makes a mistake. A more interesting case. When we generalize f to tuples of integers, we select champions by majority vote. Thus we enter the realm of (1, k)-recursive. If there are enough integers with high complexity in A, we can iteratively choose a second place champion, a third place champion, etc. The function f gets an entire tuple wrong.
20 the arena method the champion method Bauwens game Simple sets with complex strings Champions Lemma Let M be a set of binary strings, let k and m be positive integers, and let f be any unbounded function. Suppose there exist infinitely many finite sets A such that 1 M A ( 1 1 k!(k m+2) ) A, and 2 for all x M A, C(x) C(A) + f [C(A)]. Then M is not (m, k)-recursive. Theorem (reprise) For any positive integer k and any numbering ϕ with the Kolmogorov property, MIN ϕ is not (1, k)-recursive. Proof. Arena Lemma + Champions Lemma. Minimal indices are complex.
21 The converse fails the arena method the champion method Bauwens game Proposition (Teutsch, Zimand) For every positive integer k, there exists a set of natural numbers M that is not (1, k)-recursive and yet it does not satisfy the conditions of the Champions Lemma. That is, for all finite sets of natural numbers A at least one of the following holds true: 1 M A < ( 1 1 (k+1)! ) A, or 2 there exists x M A such that C(x) < C(A) + log[c(a)].
22 Bauwens game obstacles the arena method the champion method Bauwens game Theorem (reprise) There exists a numbering ϕ with the Kolmogorov property such that if f is a computable function which maps each index e to a list of indices containing min ϕ (e) then f (e) = Ω(e) for infinitely many e. Proof. Arena Lemma + secondary arena +
23 Total complexity obstacles the arena method the champion method Bauwens game We outline our approach. Definition (Muchnik) Let U be the universal machine for Kolmogorov complexity. The total complexity of a string y conditioned by x is T (y x) = min{ q : U(q, x) = y and U(q, x) for all x}. If f is computable and min ϕ (e) f (e), then T (min ϕ (e) e) log f (e) + O(1). Thus it suffices to define ϕ so that for infinitely many e, T (min ϕ (e) e) log e O(1).
24 the arena method the champion method Bauwens game Separating combinatorics from computation Bauwens game isolates the combinatorial aspect of our proof. 1 We build a numbering ϕ on binary indices so that indices with a 1 prefix code for a Kolmogorov numbering, and the indices prefixed with 0 force infinitely many minimal indices to have high total complexity. 2 The action for programs with prefix 0 are determined by a game which uses a constant number of advice bits to determine an arena with a high density of minimal indices and a secondary arena to manage artifact threats which disrupt an otherwise simple arena. The advice is coded into the program index. 3 The game itself keeps track which and how many indices get spoiled against being minimal or having high total complexity. Each time something gets spoiled, we are forced to look for a new witness. A combinatorial argument shows that we don t run out of witnesses.
25 Computably bounded numberings Numberings without the Kolmogorov property do not have constant size shortlists. Theorem (Teutsch, Zimand) For any computably bounded numbering ϕ and any constant k, there is no computable function f : N N k such that min ϕ (e) f (e) for all e. This theorem is optimal for. Proposition (Teutsch, Zimand) For any computable, unbounded, nondecreasing function g, there exists a Gödel numbering ϕ and a computable function f which maps each index e to a list of size at most g(e) such that min ϕ (e) f (e).
26 Approximations from above and below Proposition (Teutsch, Zimand) For every computably bounded numbering ϕ, no unbounded, computable function is a lower bound for min ϕ. Let K denote the halting problem. Definition A function f is (K-)approximable from above if there exists a uniform sequence of (K-)computable functions f 0, f 1,... such that for all x, f s (x) f s+1 (x) and lim s f s (x) = f (x). We define (K-)approximable from below similarly, but with the inequalities reversed. Theorem (Teutsch, Zimand) For any numbering ϕ, the function min ϕ is K-approximable from below. If ϕ is computably bounded, then min ϕ is not K-approximable from above.
27 HELP WANTED obstacles Schaefer s problem short lists Question (Schaefer) Does there exist a Gödel numbering ϕ and a positive integer k such that MIN ϕ is (1, k)-recursive? Lemma (Teutsch, Zimand) For any computably bounded numbering ϕ, the Turing degree of MIN ϕ is. This improve a prior result of Jain, Stephan, and Teutsch. Theorem (Teutsch, Zimand) For any computably bounded numbering ϕ, MIN ϕ is not (1, 2)-recursive. This improves a prior result of Schaefer.
28 Schaefer s problem short lists The set of shortest descriptions It is sometimes useful to consider a one dimensional analogue of MIN ϕ. Theorem (Stephan, Teutsch) There exists a Gödel numbering ϕ which makes the set to be (1, 2)-recursive. {e : ( j < e) ϕ j (0) ϕ e (0)} One can upgrade the above construction to a polynomially bounded numbering. Theorem (reprise) For every positive integer k and every numbering ϕ with the Kolmogorov property, MIN ϕ is not (1, k)-recursive.
29 A toy positive result Schaefer s problem short lists Definition For any numbering ϕ, with indices coded as strings, let W ϕ j RW ϕ = {x : ( j < lex x) [max W ϕ j x]}. is the set of values on which ϕ j converges, and < lex is lexicographical order on strings. Let Ω denote 1 minus Chaitin s Omega. Then Ω is approximable from above, Ω s Ω s+1, and every length n prefix of Ω has complexity at least n O(1). We let succ(x) denote the lexicographically least string greater than x. Proposition There exist a Gödel numbering ϕ such that RW ϕ is (1, 2)-recursive.
30 Proposition There exist a Gödel numbering ϕ such that RW ϕ is (1, 2)-recursive. Proof. Let I n denote the binary strings of length n + 1, and let ψ be a Gödel numbering (on integer indices). We will define ϕ so that ϕ 0 n = ψ n for all n, and for all but finitely many n, RW ψ I n = Ω n. To satisfy the second point, define for all x I n : { Wx ϕ {succ(x), succ[succ(x)]} if succ(x) lex Ω n, = {succ(x)} otherwise. Blue arrows depict indices blocking strings from membership in RW. I n,t : Ω t n
31 Proposition There exist a Gödel numbering ϕ such that RW ϕ is (1, 2)-recursive. Proof. Let I n denote the binary strings of length n + 1, and let ψ be a Gödel numbering (on integer indices). We will define ϕ so that ϕ 0 n = ψ n for all n, and for all but finitely many n, RW ψ I n = Ω n. To satisfy the second point, define for all x I n : { Wx ϕ {succ(x), succ[succ(x)]} if succ(x) lex Ω n, = {succ(x)} otherwise. Blue arrows depict indices blocking strings from membership in RW. I n,t : Ω t n
32 Proposition There exist a Gödel numbering ϕ such that RW ϕ is (1, 2)-recursive. Proof. Let I n denote the binary strings of length n + 1, and let ψ be a Gödel numbering (on integer indices). We will define ϕ so that ϕ 0 n = ψ n for all n, and for all but finitely many n, RW ψ I n = Ω n. To satisfy the second point, define for all x I n : { Wx ϕ {succ(x), succ[succ(x)]} if succ(x) lex Ω n, = {succ(x)} otherwise. Blue arrows depict indices blocking strings from membership in RW. I n,t : Ω t n
33 Proposition There exist a Gödel numbering ϕ such that RW ϕ is (1, 2)-recursive. Proof. Let I n denote the binary strings of length n + 1, and let ψ be a Gödel numbering (on integer indices). We will define ϕ so that ϕ 0 n = ψ n for all n, and for all but finitely many n, RW ψ I n = Ω n. To satisfy the second point, define for all x I n : { Wx ϕ {succ(x), succ[succ(x)]} if succ(x) lex Ω n, = {succ(x)} otherwise. Blue arrows depict indices blocking strings from membership in RW. I n,t : Ω t n
34 Schaefer s problem short lists Proposition There exist a Gödel numbering ϕ such that RW ϕ is (1, 2)-recursive. Proof (cont.) Indices of the form 0 n coding for the Gödel numbering do not destroy this picture. Indeed if for some j with 0 j < lex Ω n satisfies max W ϕ = Ω n, 0 j then, as the maxes are increasing over time and Ω is decreasing, C( Ω n) 2 log n + 2 log j + O(1) 4 log n + O(1), but this can only happen finitely often, as C( Ω n) n O(1). To see that RW ϕ is (1, 2)-recursive, observe that knowing Ω n gives complete information on membership for RW ϕ at lesser indices. Given two indices, we can label the higher one as being outside RW ϕ, and then, assuming this label is wrong, correctly guess membership on the lesser index.
35 Schaefer s problem short lists Short lists and the Kolmogorov property Theorem (reprise) For every numbering ϕ with the Kolmogorov property and any computable function f which maps each index e to a list of indices containing min ϕ (e) we have f (e) = Ω(log 2 e) for infinitely many e. Theorem (reprise) There exists a numbering ϕ with the Kolmogorov property such that if f is a computable function which maps each index e to a list of indices containing min ϕ (e) then f (e) = Ω(e) for infinitely many e. These results leave room for improvement. Question Do there exist log 2 -size shortlists for numberings with the Kolmogorov property (as is the case for strings)?
36 Short lists for strings Schaefer s problem short lists Definition We say that a bipartite graph (L, R, E) admits online matchings up to size s if there exists an algorithm such that for any set of vertices in L of size s, whose vertices are (adversarially) presented to the algorithm one at a time, the algorithm can assign each vertex in order received to one of its neighbors (without knowing what comes next), and the overall assignment after all s elements is a bijection.
37 Short lists for strings II Schaefer s problem short lists Online Matching Theorem (Bauwens, Mahklin, Musatov, Romashchenko, Shen, Teutsch, Vereshchagin, Zimand) For every k 0, there exists an explicit bipartite graph G = (L, R, E) such that L consist of all binary strings of length at least k, the cardinality of R is less than 2 k+1, the degree of each vertex x L is poly( x ), and G admits (efficient) online matching up to size 2 k. Corollary There exists a computable function which maps each binary string x to an O( x 2 ) size list containing a length C(x) + O(1) description for x.
38 contains a U-description M, z for x with z C(x) + 1 whenever C(x) x. Corollary There exists a computable function which maps each binary string x to an O( x 2 ) size list containing a length C(x) + O(1) description for x. Proof. We interpret the right hand-side of the graph in the Online Matching Theorem (OMT) to consist of strings of length k + 1. Let U be the universal machine for Kolmogorov complexity, and define a machine M which does the following. 1 Wait for a U-description p to converge (dovetail). 2 Match U(p) L in the p -size OMT graph to some z R, if U(p) is not matched already. At most 2 p strings get matched on this graph. 3 Set M(z) = U(p). Then z = p + 1. Since p can be a U-shortest description for x, the computable set { M, y : y is a neighbor of x in some OMT graph k x + O(1)}
39 Schaefer s problem short lists We are to admit no more causes of natural things than such as are both true and sufficient to explain their appearances. Therefore, to the same natural effects we must, so far as possible, assign the same causes. Isaac Newton In short, let us not waste time on excessively long computer programs. Thanks-la!
Enumerations including laconic enumerators
Enumerations including laconic enumerators Sanjay Jain National University of Singapore sanjay@comp.nus.edu.sg Jason Teutsch TrueBit Foundation jt@truebit.io June 19, 2017 Abstract We show that it is possible,
More informationA On approximate decidability of minimal programs
A On approximate decidability of minimal programs Jason Teutsch, Ben-Gurion University Marius Zimand, Towson University An index e in a numbering of partial-recursive functions is called minimal if every
More informationCompression Complexity
Compression Complexity Stephen Fenner University of South Carolina Lance Fortnow Georgia Institute of Technology February 15, 2017 Abstract The Kolmogorov complexity of x, denoted C(x), is the length of
More informationIs there an Elegant Universal Theory of Prediction?
Is there an Elegant Universal Theory of Prediction? Shane Legg Dalle Molle Institute for Artificial Intelligence Manno-Lugano Switzerland 17th International Conference on Algorithmic Learning Theory Is
More informationKolmogorov Complexity in Randomness Extraction
LIPIcs Leibniz International Proceedings in Informatics Kolmogorov Complexity in Randomness Extraction John M. Hitchcock, A. Pavan 2, N. V. Vinodchandran 3 Department of Computer Science, University of
More information3 Self-Delimiting Kolmogorov complexity
3 Self-Delimiting Kolmogorov complexity 3. Prefix codes A set is called a prefix-free set (or a prefix set) if no string in the set is the proper prefix of another string in it. A prefix set cannot therefore
More informationKolmogorov complexity
Kolmogorov complexity In this section we study how we can define the amount of information in a bitstring. Consider the following strings: 00000000000000000000000000000000000 0000000000000000000000000000000000000000
More informationCounting dependent and independent strings
Counting dependent and independent strings Marius Zimand Towson University MFCS 2010, Brno Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August 2010 1 / 15 General principle Background In
More informationOn the optimal compression of sets in P, NP, P/poly, PSPACE/poly
On the optimal compression of sets in P, NP, P/poly, PSPACE/poly Marius Zimand Towson University CCR 2012- Cambridge Marius Zimand (Towson U.) Compression P, NP, P/poly sets 2011 1 / 19 The language compression
More informationLimitations of Efficient Reducibility to the Kolmogorov Random Strings
Limitations of Efficient Reducibility to the Kolmogorov Random Strings John M. HITCHCOCK 1 Department of Computer Science, University of Wyoming Abstract. We show the following results for polynomial-time
More informationCISC 876: Kolmogorov Complexity
March 27, 2007 Outline 1 Introduction 2 Definition Incompressibility and Randomness 3 Prefix Complexity Resource-Bounded K-Complexity 4 Incompressibility Method Gödel s Incompleteness Theorem 5 Outline
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationTheory of Computation
Theory of Computation Lecture #6 Sarmad Abbasi Virtual University Sarmad Abbasi (Virtual University) Theory of Computation 1 / 39 Lecture 6: Overview Prove the equivalence of enumerators and TMs. Dovetailing
More informationKolmogorov-Loveland Randomness and Stochasticity
Kolmogorov-Loveland Randomness and Stochasticity Wolfgang Merkle 1 Joseph Miller 2 André Nies 3 Jan Reimann 1 Frank Stephan 4 1 Institut für Informatik, Universität Heidelberg 2 Department of Mathematics,
More informationAn incomplete set of shortest descriptions
An incomplete set of shortest descriptions Frank Stephan National University of Singapore Department of Mathamtics 10 Lower Kent Ridge Road, Singapore 119076 fstephan@comp.nus.edu.sg Jason Teutsch Ruprecht-Karls-Universität
More informationBjorn Poonen. MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional Varieties. January 18, 2006
University of California at Berkeley MSRI Introductory Workshop on Rational and Integral Points on Higher-dimensional Varieties January 18, 2006 The original problem H10: Find an algorithm that solves
More information2 Plain Kolmogorov Complexity
2 Plain Kolmogorov Complexity In this section, we introduce plain Kolmogorov Complexity, prove the invariance theorem - that is, the complexity of a string does not depend crucially on the particular model
More informationA New Variation of Hat Guessing Games
A New Variation of Hat Guessing Games Tengyu Ma 1, Xiaoming Sun 1, and Huacheng Yu 1 Institute for Theoretical Computer Science Tsinghua University, Beijing, China Abstract. Several variations of hat guessing
More informationStochasticity in Algorithmic Statistics for Polynomial Time
Stochasticity in Algorithmic Statistics for Polynomial Time Alexey Milovanov 1 and Nikolay Vereshchagin 2 1 National Research University Higher School of Economics, Moscow, Russia almas239@gmail.com 2
More informationDerandomizing from Random Strings
Derandomizing from Random Strings Harry Buhrman CWI and University of Amsterdam buhrman@cwi.nl Lance Fortnow Northwestern University fortnow@northwestern.edu Michal Koucký Institute of Mathematics, AS
More informationUniversal probability-free conformal prediction
Universal probability-free conformal prediction Vladimir Vovk and Dusko Pavlovic March 20, 2016 Abstract We construct a universal prediction system in the spirit of Popper s falsifiability and Kolmogorov
More informationSymmetry of Information: A Closer Look
Symmetry of Information: A Closer Look Marius Zimand. Department of Computer and Information Sciences, Towson University, Baltimore, MD, USA Abstract. Symmetry of information establishes a relation between
More informationHARDNESS AMPLIFICATION VIA SPACE-EFFICIENT DIRECT PRODUCTS
HARDNESS AMPLIFICATION VIA SPACE-EFFICIENT DIRECT PRODUCTS Venkatesan Guruswami and Valentine Kabanets Abstract. We prove a version of the derandomized Direct Product lemma for deterministic space-bounded
More information1 Computational Problems
Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationLecture 20: conp and Friends, Oracles in Complexity Theory
6.045 Lecture 20: conp and Friends, Oracles in Complexity Theory 1 Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode:
More informationQ = Set of states, IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar
IE661: Scheduling Theory (Fall 2003) Primer to Complexity Theory Satyaki Ghosh Dastidar Turing Machine A Turing machine is an abstract representation of a computing device. It consists of a read/write
More informationThe halting problem is decidable on a set of asymptotic probability one
The halting problem is decidable on a set of asymptotic probability one Joel David Hamkins The City University of New York http://jdh.hamkins.org Alexei Miasnikov The City University of New York http://www.cs.gc.cuny.edu/
More informationCS 6820 Fall 2014 Lectures, October 3-20, 2014
Analysis of Algorithms Linear Programming Notes CS 6820 Fall 2014 Lectures, October 3-20, 2014 1 Linear programming The linear programming (LP) problem is the following optimization problem. We are given
More informationLecture 6: Oracle TMs, Diagonalization Limits, Space Complexity
CSE 531: Computational Complexity I Winter 2016 Lecture 6: Oracle TMs, Diagonalization Limits, Space Complexity January 22, 2016 Lecturer: Paul Beame Scribe: Paul Beame Diagonalization enabled us to separate
More informationNotes for Lecture Notes 2
Stanford University CS254: Computational Complexity Notes 2 Luca Trevisan January 11, 2012 Notes for Lecture Notes 2 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationLimit Complexities Revisited
DOI 10.1007/s00224-009-9203-9 Limit Complexities Revisited Laurent Bienvenu Andrej Muchnik Alexander Shen Nikolay Vereshchagin Springer Science+Business Media, LLC 2009 Abstract The main goal of this article
More informationKolmogorov complexity and its applications
Spring, 2009 Kolmogorov complexity and its applications Paul Vitanyi Computer Science University of Amsterdam http://www.cwi.nl/~paulv/course-kc We live in an information society. Information science is
More informationCS 125 Section #10 (Un)decidability and Probability November 1, 2016
CS 125 Section #10 (Un)decidability and Probability November 1, 2016 1 Countability Recall that a set S is countable (either finite or countably infinite) if and only if there exists a surjective mapping
More informationJournal of Computer and System Sciences
Journal of Computer and System Sciences 77 (2011) 738 742 Contents lists available at ScienceDirect Journal of Computer and System Sciences www.elsevier.com/locate/jcss Nonapproximability of the normalized
More informationLecture notes on OPP algorithms [Preliminary Draft]
Lecture notes on OPP algorithms [Preliminary Draft] Jesper Nederlof June 13, 2016 These lecture notes were quickly assembled and probably contain many errors. Use at your own risk! Moreover, especially
More informationRandomized Computation
Randomized Computation Slides based on S.Aurora, B.Barak. Complexity Theory: A Modern Approach. Ahto Buldas Ahto.Buldas@ut.ee We do not assume anything about the distribution of the instances of the problem
More informationThis is logically equivalent to the conjunction of the positive assertion Minimal Arithmetic and Representability
16.2. MINIMAL ARITHMETIC AND REPRESENTABILITY 207 If T is a consistent theory in the language of arithmetic, we say a set S is defined in T by D(x) if for all n, if n is in S, then D(n) is a theorem of
More informationLecture 59 : Instance Compression and Succinct PCP s for NP
IITM-CS6840: Advanced Complexity Theory March 31, 2012 Lecture 59 : Instance Compression and Succinct PCP s for NP Lecturer: Sivaramakrishnan N.R. Scribe: Prashant Vasudevan 1 Introduction Classical Complexity
More information,
Kolmogorov Complexity Carleton College, CS 254, Fall 2013, Prof. Joshua R. Davis based on Sipser, Introduction to the Theory of Computation 1. Introduction Kolmogorov complexity is a theory of lossless
More informationA version of for which ZFC can not predict a single bit Robert M. Solovay May 16, Introduction In [2], Chaitin introd
CDMTCS Research Report Series A Version of for which ZFC can not Predict a Single Bit Robert M. Solovay University of California at Berkeley CDMTCS-104 May 1999 Centre for Discrete Mathematics and Theoretical
More informationTURING MAHINES
15-453 TURING MAHINES TURING MACHINE FINITE STATE q 10 CONTROL AI N P U T INFINITE TAPE read write move 0 0, R, R q accept, R q reject 0 0, R 0 0, R, L read write move 0 0, R, R q accept, R 0 0, R 0 0,
More informationCSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides
CSE 4111/5111/6111 Computability Jeff Edmonds Assignment 3: Diagonalization & Halting Problem Due: One week after shown in slides First Person: Second Person: Family Name: Family Name: Given Name: Given
More information1 Randomized Computation
CS 6743 Lecture 17 1 Fall 2007 1 Randomized Computation Why is randomness useful? Imagine you have a stack of bank notes, with very few counterfeit ones. You want to choose a genuine bank note to pay at
More informationDoes the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? Harry Buhrman 1, Lance Fortnow 2, Michal Koucký 3, John D. Rogers 4, and Nikolay Vereshchagin 5 1 CWI, Amsterdam, buhrman@cwi.nl
More informationREU 2007 Transfinite Combinatorics Lecture 9
REU 2007 Transfinite Combinatorics Lecture 9 Instructor: László Babai Scribe: Travis Schedler August 10, 2007. Revised by instructor. Last updated August 11, 3:40pm Note: All (0, 1)-measures will be assumed
More informationWe are going to discuss what it means for a sequence to converge in three stages: First, we define what it means for a sequence to converge to zero
Chapter Limits of Sequences Calculus Student: lim s n = 0 means the s n are getting closer and closer to zero but never gets there. Instructor: ARGHHHHH! Exercise. Think of a better response for the instructor.
More information15.1 Proof of the Cook-Levin Theorem: SAT is NP-complete
CS125 Lecture 15 Fall 2016 15.1 Proof of the Cook-Levin Theorem: SAT is NP-complete Already know SAT NP, so only need to show SAT is NP-hard. Let L be any language in NP. Let M be a NTM that decides L
More informationCSCI3390-Lecture 6: An Undecidable Problem
CSCI3390-Lecture 6: An Undecidable Problem September 21, 2018 1 Summary The language L T M recognized by the universal Turing machine is not decidable. Thus there is no algorithm that determines, yes or
More informationFurther discussion of Turing machines
Further discussion of Turing machines In this lecture we will discuss various aspects of decidable and Turing-recognizable languages that were not mentioned in previous lectures. In particular, we will
More informationChaitin Ω Numbers and Halting Problems
Chaitin Ω Numbers and Halting Problems Kohtaro Tadaki Research and Development Initiative, Chuo University CREST, JST 1 13 27 Kasuga, Bunkyo-ku, Tokyo 112-8551, Japan E-mail: tadaki@kc.chuo-u.ac.jp Abstract.
More informationLecture 23 : Nondeterministic Finite Automata DRAFT Connection between Regular Expressions and Finite Automata
CS/Math 24: Introduction to Discrete Mathematics 4/2/2 Lecture 23 : Nondeterministic Finite Automata Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT Last time we designed finite state automata
More informationSome Properties of Antistochastic Strings. Alexey Milovanov. Theory of Computing Systems ISSN
Some Properties of Antistochastic Strings Alexey Milovanov Theory of Computing Systems ISSN 1432-4350 DOI 10.1007/s00224-016-9695-z 1 23 Your article is protected by copyright and all rights are held exclusively
More informationAn Application of First-Order Logic to a Problem in Combinatorics 1
An Application of First-Order Logic to a Problem in Combinatorics 1 I. The Combinatorial Background. A. Families of objects. In combinatorics, one frequently encounters a set of objects in which a), each
More informationSophistication Revisited
Sophistication Revisited Luís Antunes Lance Fortnow August 30, 007 Abstract Kolmogorov complexity measures the ammount of information in a string as the size of the shortest program that computes the string.
More information: On the P vs. BPP problem. 30/12/2016 Lecture 12
03684155: On the P vs. BPP problem. 30/12/2016 Lecture 12 Time Hierarchy Theorems Amnon Ta-Shma and Dean Doron 1 Diagonalization arguments Throughout this lecture, for a TM M, we denote M t to be the machine
More informationGame interpretation of Kolmogorov complexity
Game interpretation of Kolmogorov complexity Andrej A. Muchnik, Ilya Mezhirov, Alexander Shen, Nikolay Vereshchagin Abstract arxiv:1003.4712v1 [math.lo] 24 Mar 2010 The Kolmogorov complexity function K
More informationCounting dependent and independent strings
Counting dependent and independent strings Marius Zimand Department of Computer and Information Sciences, Towson University, Baltimore, MD, USA Abstract. We derive quantitative results regarding sets of
More informationOn Aperiodic Subtraction Games with Bounded Nim Sequence
On Aperiodic Subtraction Games with Bounded Nim Sequence Nathan Fox arxiv:1407.2823v1 [math.co] 10 Jul 2014 Abstract Subtraction games are a class of impartial combinatorial games whose positions correspond
More informationGame arguments in computability theory and algorithmic information theory
Game arguments in computability theory and algorithmic information theory Andrej Muchnik Alexander Shen Mikhail Vyugin September 10, 2012 Abstract We provide some examples showing how game-theoretic arguments
More informationCS 350 Algorithms and Complexity
CS 350 Algorithms and Complexity Winter 2019 Lecture 15: Limitations of Algorithmic Power Introduction to complexity theory Andrew P. Black Department of Computer Science Portland State University Lower
More informationTheory of Computation
Theory of Computation Unit 4-6: Turing Machines and Computability Decidability and Encoding Turing Machines Complexity and NP Completeness Syedur Rahman syedurrahman@gmail.com Turing Machines Q The set
More informationAverage Case Complexity: Levin s Theory
Chapter 15 Average Case Complexity: Levin s Theory 1 needs more work Our study of complexity - NP-completeness, #P-completeness etc. thus far only concerned worst-case complexity. However, algorithms designers
More informationYale University Department of Computer Science
Yale University Department of Computer Science Lower Bounds on Learning Random Structures with Statistical Queries Dana Angluin David Eisenstat Leonid (Aryeh) Kontorovich Lev Reyzin YALEU/DCS/TR-42 December
More informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY THURSDAY APRIL 3 REVIEW for Midterm TUESDAY April 8 Definition: A Turing Machine is a 7-tuple T = (Q, Σ, Γ, δ, q, q accept, q reject ), where: Q is a
More informationCSCI 2200 Foundations of Computer Science Spring 2018 Quiz 3 (May 2, 2018) SOLUTIONS
CSCI 2200 Foundations of Computer Science Spring 2018 Quiz 3 (May 2, 2018) SOLUTIONS 1. [6 POINTS] For language L 1 = {0 n 1 m n, m 1, m n}, which string is in L 1? ANSWER: 0001111 is in L 1 (with n =
More informationPossibilities and impossibilities in Kolmogorov complexity extraction
Possibilities and impossibilities in Kolmogorov complexity extraction Marius Zimand Abstract Randomness extraction is the process of constructing a source of randomness of high quality from one or several
More informationKolmogorov structure functions for automatic complexity
Kolmogorov structure functions for automatic complexity Bjørn Kjos-Hanssen June 16, 2015 Varieties of Algorithmic Information, University of Heidelberg Internationales Wissenschaftssentrum History 1936:
More informationProgram size complexity for possibly infinite computations
Program size complexity for possibly infinite computations Verónica Becher Santiago Figueira André Nies Silvana Picchi Abstract We define a program size complexity function H as a variant of the prefix-free
More informationGENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY
GENERIC COMPUTABILITY, TURING DEGREES, AND ASYMPTOTIC DENSITY CARL G. JOCKUSCH, JR. AND PAUL E. SCHUPP Abstract. Generic decidability has been extensively studied in group theory, and we now study it in
More informationThe complexity of stochastic sequences
The complexity of stochastic sequences Wolfgang Merkle Ruprecht-Karls-Universität Heidelberg Institut für Informatik Im Neuenheimer Feld 294 D-69120 Heidelberg, Germany merkle@math.uni-heidelberg.de Abstract
More information(x 1 +x 2 )(x 1 x 2 )+(x 2 +x 3 )(x 2 x 3 )+(x 3 +x 1 )(x 3 x 1 ).
CMPSCI611: Verifying Polynomial Identities Lecture 13 Here is a problem that has a polynomial-time randomized solution, but so far no poly-time deterministic solution. Let F be any field and let Q(x 1,...,
More informationPreface These notes were prepared on the occasion of giving a guest lecture in David Harel's class on Advanced Topics in Computability. David's reques
Two Lectures on Advanced Topics in Computability Oded Goldreich Department of Computer Science Weizmann Institute of Science Rehovot, Israel. oded@wisdom.weizmann.ac.il Spring 2002 Abstract This text consists
More informationSpring 2014 Advanced Probability Overview. Lecture Notes Set 1: Course Overview, σ-fields, and Measures
36-752 Spring 2014 Advanced Probability Overview Lecture Notes Set 1: Course Overview, σ-fields, and Measures Instructor: Jing Lei Associated reading: Sec 1.1-1.4 of Ash and Doléans-Dade; Sec 1.1 and A.1
More informationKOLMOGOROV COMPLEXITY AND THE RECURSION THEOREM
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 0002-9947(XX)0000-0 KOLMOGOROV COMPLEXITY AND THE RECURSION THEOREM BJØRN KJOS-HANSSEN, WOLFGANG MERKLE, AND FRANK
More informationAhlswede Khachatrian Theorems: Weighted, Infinite, and Hamming
Ahlswede Khachatrian Theorems: Weighted, Infinite, and Hamming Yuval Filmus April 4, 2017 Abstract The seminal complete intersection theorem of Ahlswede and Khachatrian gives the maximum cardinality of
More information1 Arithmetic complexity via effective names for random sequences
1 Arithmetic complexity via effective names for random sequences BJØRN KJOS-HANSSEN, University of Hawai i at Mānoa FRANK STEPHAN, National University of Singapore JASON R. TEUTSCH, Ruprecht-Karls-Universität
More informationExact Learning Algorithms, Betting Games, and Circuit Lower Bounds
Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds Ryan C. Harkins and John M. Hitchcock Abstract This paper extends and improves work of Fortnow and Klivans [6], who showed that if a circuit
More information1 Reductions and Expressiveness
15-451/651: Design & Analysis of Algorithms November 3, 2015 Lecture #17 last changed: October 30, 2015 In the past few lectures we have looked at increasingly more expressive problems solvable using efficient
More informationLecture 18: PCP Theorem and Hardness of Approximation I
Lecture 18: and Hardness of Approximation I Arijit Bishnu 26.04.2010 Outline 1 Introduction to Approximation Algorithm 2 Outline 1 Introduction to Approximation Algorithm 2 Approximation Algorithm Approximation
More informationComputational Complexity for Algebraists
Computational Complexity for Algebraists Ross Willard University of Waterloo, Canada January 20, 2009 Ross Willard (Waterloo) Complexity for Algebraists January 20, 2009 1 / 23 Outline First hour: Decision
More informationComputability and Complexity Theory: An Introduction
Computability and Complexity Theory: An Introduction meena@imsc.res.in http://www.imsc.res.in/ meena IMI-IISc, 20 July 2006 p. 1 Understanding Computation Kinds of questions we seek answers to: Is a given
More informationNP-Completeness. Until now we have been designing algorithms for specific problems
NP-Completeness 1 Introduction Until now we have been designing algorithms for specific problems We have seen running times O(log n), O(n), O(n log n), O(n 2 ), O(n 3 )... We have also discussed lower
More informationLecture 13: Foundations of Math and Kolmogorov Complexity
6.045 Lecture 13: Foundations of Math and Kolmogorov Complexity 1 Self-Reference and the Recursion Theorem 2 Lemma: There is a computable function q : Σ* Σ* such that for every string w, q(w) is the description
More information6-1 Computational Complexity
6-1 Computational Complexity 6. Computational Complexity Computational models Turing Machines Time complexity Non-determinism, witnesses, and short proofs. Complexity classes: P, NP, conp Polynomial-time
More informationAdvanced topic: Space complexity
Advanced topic: Space complexity CSCI 3130 Formal Languages and Automata Theory Siu On CHAN Chinese University of Hong Kong Fall 2016 1/28 Review: time complexity We have looked at how long it takes to
More informationCOS 511: Theoretical Machine Learning. Lecturer: Rob Schapire Lecture 24 Scribe: Sachin Ravi May 2, 2013
COS 5: heoretical Machine Learning Lecturer: Rob Schapire Lecture 24 Scribe: Sachin Ravi May 2, 203 Review of Zero-Sum Games At the end of last lecture, we discussed a model for two player games (call
More informationConstant compression and random weights *
Computability 1 (2012) 1 18 DOI IOS Press 1 Constant compression and random weights * Wolfgang erkle Ruprecht-Karls-niversität Heidelberg Institut für Informatik Heidelberg, Germany merkle@math.uni-heidelberg.de
More informationCSCC63 Worksheet Turing Machines
1 An Example CSCC63 Worksheet Turing Machines Goal. Design a turing machine, M that accepts only strings of the form {w#w w {0, 1} }. Idea. Describe in words how the machine would work. Read first symbol
More informationRandom Reals à la Chaitin with or without prefix-freeness
Random Reals à la Chaitin with or without prefix-freeness Verónica Becher Departamento de Computación, FCEyN Universidad de Buenos Aires - CONICET Argentina vbecher@dc.uba.ar Serge Grigorieff LIAFA, Université
More informationOn enumerating monomials and other combinatorial structures by polynomial interpolation
Theory of Computing Systems manuscript No. (will be inserted by the editor) On enumerating monomials and other combinatorial structures by polynomial interpolation Yann Strozecki the date of receipt and
More informationFinish K-Complexity, Start Time Complexity
6.045 Finish K-Complexity, Start Time Complexity 1 Kolmogorov Complexity Definition: The shortest description of x, denoted as d(x), is the lexicographically shortest string such that M(w) halts
More information1 Computational problems
80240233: Computational Complexity Lecture 1 ITCS, Tsinghua Univesity, Fall 2007 9 October 2007 Instructor: Andrej Bogdanov Notes by: Andrej Bogdanov The aim of computational complexity theory is to study
More informationKolmogorov complexity and its applications
CS860, Winter, 2010 Kolmogorov complexity and its applications Ming Li School of Computer Science University of Waterloo http://www.cs.uwaterloo.ca/~mli/cs860.html We live in an information society. Information
More informationComparing Reductions to NP-Complete Sets
Comparing Reductions to NP-Complete Sets John M. Hitchcock A. Pavan Abstract Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following:
More informationOnline Learning, Mistake Bounds, Perceptron Algorithm
Online Learning, Mistake Bounds, Perceptron Algorithm 1 Online Learning So far the focus of the course has been on batch learning, where algorithms are presented with a sample of training data, from which
More informationMitosis in Computational Complexity
Mitosis in Computational Complexity Christian Glaßer 1, A. Pavan 2, Alan L. Selman 3, and Liyu Zhang 4 1 Universität Würzburg, glasser@informatik.uni-wuerzburg.de 2 Iowa State University, pavan@cs.iastate.edu
More information10.4 The Kruskal Katona theorem
104 The Krusal Katona theorem 141 Example 1013 (Maximum weight traveling salesman problem We are given a complete directed graph with non-negative weights on edges, and we must find a maximum weight Hamiltonian
More informationBefore We Start. The Pumping Lemma. Languages. Context Free Languages. Plan for today. Now our picture looks like. Any questions?
Before We Start The Pumping Lemma Any questions? The Lemma & Decision/ Languages Future Exam Question What is a language? What is a class of languages? Context Free Languages Context Free Languages(CFL)
More information