The following pages link to Salvatore Caporaso (Q1045887):
Displaying 10 items.
- A decidable characterization of the classes between lintime and exptime (Q1045888) (← links)
- On a relation between uniform coding and problems of the form DTIMEF\((\mathcal F)=?\)DSPACEF\((\mathcal F)\) (Q1284694) (← links)
- (Q1589420) (redirect page) (← links)
- A predicative and decidable characterization of the polynomial classes of languages (Q1589422) (← links)
- (Q2709224) (← links)
- A predicative approach to the classification problem (Q2740987) (← links)
- Undecidability vs transfinite induction for the consistency of hyperarithmetical sets (Q3956932) (← links)
- Consistency proof without transfinite induction for a formal system for turing machines (Q4192056) (← links)
- (Q4503940) (← links)
- SAFE TURING MACHINES, GRZEGORCZYK CLASSES AND POLYTIME (Q5687659) (← links)
