1 problem
- 0 votes0 replies0 views
Hardness conjecture for Kolmogorov-randomness unprovability tautologies
Let be a finitely axiomatized theory. Consider -uniform families of propositional tautologies encoding statements of the form “there is no p…
Hardness conjecture for Kolmogorov-randomness unprovability tautologies
Let be a finitely axiomatized theory. Consider -uniform families of propositional tautologies encoding statements of the form “there is no p…