Comparing computational entropies below majority (or: When is the dense model theorem false?)

11/12/2020
by   Russell Impagliazzo, et al.
0

Computational pseudorandomness studies the extent to which a random variable Z looks like the uniform distribution according to a class of tests F. Computational entropy generalizes computational pseudorandomness by studying the extent which a random variable looks like a high entropy distribution. There are different formal definitions of computational entropy with different advantages for different applications. Because of this, it is of interest to understand when these definitions are equivalent. We consider three notions of computational entropy which are known to be equivalent when the test class F is closed under taking majorities. This equivalence constitutes (essentially) the so-called dense model theorem of Green and Tao (and later made explicit by Tao-Zeigler, Reingold et al., and Gowers). The dense model theorem plays a key role in Green and Tao's proof that the primes contain arbitrarily long arithmetic progressions and has since been connected to a surprisingly wide range of topics in mathematics and computer science, including cryptography, computational complexity, combinatorics and machine learning. We show that, in different situations where F is not closed under majority, this equivalence fails. This in turn provides examples where the dense model theorem is false.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2017

Equivalence of Intuitionistic Inductive Definitions and Intuitionistic Cyclic Proofs under Arithmetic

A cyclic proof system gives us another way of representing inductive def...
research
07/29/2021

A Theory of Consciousness from a Theoretical Computer Science Perspective: Insights from the Conscious Turing Machine

The quest to understand consciousness, once the purview of philosophers ...
research
10/27/2019

Formalising perfectoid spaces

Perfectoid spaces are sophisticated objects in arithmetic geometry intro...
research
12/27/2017

Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs

A cyclic proof system, called CLKID-omega, gives us another way of repre...
research
09/30/2019

On Herbrand Skeletons

Herbrand's theorem plays an important role both in proof theory and in c...
research
07/17/2018

An exposition of the false confidence theorem

A recent paper presents the "false confidence theorem" (FCT) which has p...
research
04/07/2023

Replicability and stability in learning

Replicability is essential in science as it allows us to validate and ve...

Please sign up or login with your details

Forgot password? Click here to reset