Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic - Kolmogorov complexity - Document - PDFSEARCH.IO

First Page	Meta Content
	Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic Add to Reading List Document Date: 2013-04-27 00:54:51 Open Document File Size: 227,59 KB Share Result on Facebook Company Creative Commons / / IndustryTerm proof systems / formal proof systems / / Organization National Science Foundation / National Natural Science Foundation of China Grant / / Person Luke Friedman / Samuel B. Hopkins / Iddo Tzameret Licensed / George Davie Luke Friedman† Samuel / George Davie / Samuel B. Hopkins‡ Iddo Tzameret / Eric Allender / / ProgrammingLanguage RC / / ProvinceOrState Pennsylvania / / URL http / SocialTag Computability theory Analysis of algorithms Descriptive complexity Kolmogorov complexity Bounded-error probabilistic polynomial FO PP IP Time complexity Theoretical computer science

Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of ArithmeticAdd to Reading List