Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

LOGCOM
2007

favoriteEmaildiscussreport

92views more LOGCOM 2007»

Third-Order Computation and Bounded Arithmetic

13 years 4 months ago

Third-Order Computation and Bounded Arithmetic

Download www.cs.toronto.edu

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 deﬁnable functions are the classes of the EXP-time hierarchy in the third-order setting.

Alan Skelley

Real-time Traffic

Large Complexity Classes | LOGCOM 2007 | Ordinary Computation | Third-order Theories |

claim paper

Related Content

» A ThirdOrder Bounded Arithmetic Theory for PSPACE

» Normalization at the arithmetic bit level

» Upper and Lower Bounds on ContinuousTime Computation

» NonCommutative Arithmetic Circuits Depth Reduction and Size Lower Bounds

» A SimplexBased Extension of FourierMotzkin for Solving Linear Integer Arithmetic

» A Lower Bound for the Size of Syntactically Multilinear Arithmetic Circuits

» On Rules and Parameter Free Systems in Bounded Arithmetic

» Complete Interval Arithmetic and its Implementation

» On the Computational Complexity of CutReduction

Post Info
More Details (n/a)

Added	16 Dec 2010
Updated	16 Dec 2010
Type	Journal
Year	2007
Where	LOGCOM
Authors	Alan Skelley

Comments (0)