Salvatore Caporaso

According to our database1, Salvatore Caporaso
  • authored at least 12 papers between 1978 and 2007.
  • has a "Dijkstra number"2 of six.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

2006
A decidable characterization of the classes between lintime and exptime.
Inf. Process. Lett., 2006

A Predicative Harmonization of the Time and Provable Hierarchies
CoRR, 2006

2001
A predicative and decidable characterization of the polynomial classes of languages.
Theor. Comput. Sci., 2001

A predicative approach to the classification problem.
J. Funct. Program., 2001

2000
Incompleteness in Linear Time.
J. UCS, 2000

Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1998
On a Relation Between Uniform Coding and Problems of the Form DTIMEF(F) =? DSPACEF(F).
Acta Inf., 1998

1997
Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy.
Proceedings of the Algorithms and Complexity, Third Italian Conference, 1997

1996
Safe Turing Machines, Grzegorczyk Classes and Polytime.
Int. J. Found. Comput. Sci., 1996

1980
Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.
Arch. Math. Log., 1980

1978
Consistency proof without transfinite induction for a formal system for turing machines.
Arch. Math. Log., 1978


  Loading...