Abstract : We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization shows that adding a choice command to a Ptime language (the language WHILE of Jones) may not necessarily provide NPtime computations. The result is close to Cook who used “auxiliary push-down automata”. Logspace is obtained through a decidable mechanism of tiering. It is based on an analysis of deforestation due to Wadler in. We get also a characterization of NLogspace.
https://hal.inria.fr/inria-00105744
Contributor : Guillaume Bonfante
<>
Submitted on : Thursday, October 12, 2006 - 11:40:29 AM
Last modification on : Thursday, January 11, 2018 - 6:19:48 AM
Long-term archiving on: Thursday, September 20, 2012 - 11:45:24 AM
Guillaume Bonfante. Some programming languages for LOGSPACE and PTIME. 11th International Conference on Algebraic Methodology and Software Technology - AMAST'06, Jul 2006, Kuresaare/Estonie. ⟨inria-00105744⟩
