Salvatore Caporaso

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
A decidable characterization of the classes between lintime and exptime Information Processing Letters	2009-12-18	Paper
A predicative approach to the classification problem Journal of Functional Programming	2001-09-09	Paper
Incompleteness in linear time Journal of Universal Computer Science	2001-05-10	Paper
A predicative and decidable characterization of the polynomial classes of languages Theoretical Computer Science	2000-12-12	Paper
scientific article; zbMATH DE number 1507220 (Why is no real title available?)	2000-09-14	Paper
On a relation between uniform coding and problems of the form DTIMEF\((\mathcal F)=?\)DSPACEF\((\mathcal F)\) Acta Informatica	1999-04-26	Paper
SAFE TURING MACHINES, GRZEGORCZYK CLASSES AND POLYTIME International Journal of Foundations of Computer Science	1997-03-31	Paper
Undecidability vs transfinite induction for the consistency of hyperarithmetical sets Archiv für mathematische Logik und Grundlagenforschung	1982-01-01	Paper
Consistency proof without transfinite induction for a formal system for turing machines Archiv für Mathematische Logik und Grundlagenforschung	1978-01-01	Paper

Research outcomes over time

This page was built for person: Salvatore Caporaso