Salvatore Caporaso

12 papers C 2Journal 10
YearRankTypeTitle / Venue / Authors
2007 J jnl
Kleene, Rogers and Rice Theorems Revisited in C and in Bash
CoRR
Salvatore Caporaso, Nicola Corriero
2006 J jnl
A Predicative Harmonization of the Time and Provable Hierarchies
CoRR
Salvatore Caporaso
2006 J jnl
A decidable characterization of the classes between lintime and exptime.
Inf. Process. Lett.
Salvatore Caporaso
2001 J jnl
A predicative and decidable characterization of the polynomial classes of languages.
Theor. Comput. Sci.
Salvatore Caporaso, Michele Zito, Nicola Galesi
2001 J jnl
A predicative approach to the classification problem.
J. Funct. Program.
Salvatore Caporaso, Emanuele Covino, Giovanni Pani
2000 C conf
Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.
CIAC
Emanuele Covino, Giovanni Pani, Salvatore Caporaso
2000 J jnl
Incompleteness in Linear Time.
J. Univers. Comput. Sci.
Salvatore Caporaso, Giovanni Pani, Emanuele Covino
1998 J jnl
On a Relation Between Uniform Coding and Problems of the Form DTIMEF(
Acta Informatica
Salvatore Caporaso, Michele Zito
1997 C conf
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy.
CIAC
Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino
1996 J jnl
Safe Turing Machines, Grzegorczyk Classes and Polytime.
Int. J. Found. Comput. Sci.
Salvatore Caporaso
1980 J jnl
Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.
Arch. Math. Log.
Salvatore Caporaso, Giovanni Pani
1978 J jnl
Consistency proof without transfinite induction for a formal system for turing machines.
Arch. Math. Log.
Salvatore Caporaso