Salvatore Caporaso

According to our database, Salvatore Caporaso authored at least 12 papers between 1978 and 2007.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2007

Kleene, Rogers and Rice Theorems Revisited in C and in Bash

Salvatore Caporaso, Nicola Corriero

CoRR, 2007

2006

A decidable characterization of the classes between lintime and exptime.

Salvatore Caporaso

Inf. Process. Lett., 2006

A Predicative Harmonization of the Time and Provable Hierarchies

Salvatore Caporaso

CoRR, 2006

2001

A predicative and decidable characterization of the polynomial classes of languages.

Salvatore Caporaso, Michele Zito, Nicola Galesi

Theor. Comput. Sci., 2001

A predicative approach to the classification problem.

Salvatore Caporaso, Emanuele Covino, Giovanni Pani

J. Funct. Program., 2001

2000

Incompleteness in Linear Time.

Salvatore Caporaso, Giovanni Pani, Emanuele Covino

J. Univers. Comput. Sci., 2000

Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.

Emanuele Covino, Giovanni Pani, Salvatore Caporaso

Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1998

On a Relation Between Uniform Coding and Problems of the Form DTIMEF(<i>F</i>) =? DSPACEF(<i>F</i>).

Salvatore Caporaso, Michele Zito

Acta Informatica, 1998

1997

Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy.

Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino

Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996

Safe Turing Machines, Grzegorczyk Classes and Polytime.

Salvatore Caporaso

Int. J. Found. Comput. Sci., 1996

1980

Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.

Salvatore Caporaso, Giovanni Pani

Arch. Math. Log., 1980

1978

Consistency proof without transfinite induction for a formal system for turing machines.

Salvatore Caporaso

Arch. Math. Log., 1978