most citedResource Bounded Unprovability of Computational Lower Bounds

1 citations · 1 across the 1 of their papers we have counts for

collaborators

1 paper

cs.CC2005★ 1 cited

Resource Bounded Unprovability of Computational Lower Bounds

Tatsuaki Okamoto, Ryo Kashima

This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic…