Sciweavers

Share
LOGCOM
2007

Third-Order Computation and Bounded Arithmetic

9 years 11 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characterizations of several large complexity classes. We then present a number of third-order theories of bounded arithmetic whose definable functions are the classes of the EXP-time hierarchy in the third-order setting.
Alan Skelley
Added 16 Dec 2010
Updated 16 Dec 2010
Type Journal
Year 2007
Where LOGCOM
Authors Alan Skelley
Comments (0)
books