Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic

Research output: Contribution to journal › Article › peer-review

63 Downloads (Pure)

Original language	English
Pages (from-to)	1-15
Number of pages	15
Journal	Chicago Journal of Theoretical Computer Science
Volume	5
Publication status	Published - 2013

Access to Document

@article{7c1cb1c132c34c4db98910a6155d3799,

title = "Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic",

author = "Eric Allender and George Davie and Luke Friedman and Sam Hopkins and Iddo Tzameret",

year = "2013",

language = "English",

volume = "5",

pages = "1--15",

journal = "Chicago Journal of Theoretical Computer Science",

issn = "1073-0486",

}

TY - JOUR

T1 - Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic

AU - Allender, Eric

AU - Davie, George

AU - Friedman, Luke

AU - Hopkins, Sam

AU - Tzameret, Iddo

PY - 2013

Y1 - 2013

M3 - Article

SN - 1073-0486

VL - 5

SP - 1

EP - 15

JO - Chicago Journal of Theoretical Computer Science

JF - Chicago Journal of Theoretical Computer Science

ER -