Salvatore Caporaso

Available identifiers

zbMath Open caporaso.salvatoreMaRDI QIDQ1045887

List of research outcomes

Publication	Date of Publication	Type
A decidable characterization of the classes between lintime and exptime	2009-12-18	Paper
A predicative approach to the classification problem	2001-09-09	Paper
Incompleteness in linear time	2001-05-10	Paper
A predicative and decidable characterization of the polynomial classes of languages	2000-12-12	Paper
https://portal.mardi4nfdi.de/entity/Q4503940	2000-09-14	Paper
On a relation between uniform coding and problems of the form DTIMEF\((\mathcal F)=?\)DSPACEF\((\mathcal F)\)	1999-04-26	Paper
SAFE TURING MACHINES, GRZEGORCZYK CLASSES AND POLYTIME	1997-03-31	Paper
Undecidability vs transfinite induction for the consistency of hyperarithmetical sets	1982-01-01	Paper
Consistency proof without transfinite induction for a formal system for turing machines	1978-01-01	Paper

Research outcomes over time

This page was built for person: Salvatore Caporaso