7 citations · 14 across the 8 of their papers we have counts for
8 papers
Ruling Out Short Proofs of Unprovable Sentences is Hard
Hunter Monroe
If no optimal propositional proof system exists, we (and independently Pudlák) prove that ruling out length proofs of any unprovable sentence is hard. This mapping from unprova…
Hardness of Ruling Out Short Proofs of Kolmogorov Randomness
Hunter Monroe
A meta-complexity assumption, Feasible Chaitin Incompleteness (FCI), asserts the hardness of ruling out length proofs that string is Kolmogorov random (e.g. ), by…
Average-Case Hardness of Proving Tautologies and Theorems
Hunter Monroe
We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a -isomorp…
Speedup for Natural Problems and Noncomputability
Hunter Monroe
A resource-bounded version of the statement "no algorithm recognizes all non-halting Turing machines" is equivalent to an infinitely often (i.o.) superpolynomial speedup for the ti…
Are Causality Violations Undesirable?
Hunter Monroe
Causality violations are typically seen as unrealistic and undesirable features of a physical model. The following points out three reasons why causality violations, which Bonnor a…
Topology and Closed Timelike Curves II: Causal structure
Hunter Monroe
Because no closed timelike curve (CTC) on a Lorentzian manifold can be deformed to a point, any such manifold containing a CTC must have a topological feature, to be called a timel…