In this talk we will discuss about proof-theoretic approaches to computational complexity in terms of weak theories of arithmetic as known as theories of bounded arithmetic, which was initiated by Samuel Buss. We will start with classical facts on primitive recursive functions, and then go into discussion about polynomial time functions and polynomial space… (More)

@inproceedings{Eguchi2012WeakTO,
title={Weak Theories of Arithmetic for Computational Complexity: A Gentle Introduction},
author={Naohi Eguchi and Toshiyasu Arai},
year={2012}
}