A Connection Between Blum Speedable Sets and Gödel's Speed-Up Theorem

DOI10.1002/MALQ.19870330505zbMath0611.03026OpenAlexW2160122737MaRDI QIDQ3751574

Martin Kenneth Solomon

Publication date: 1987

Published in: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19870330505

zbMATH Keywords

length of proofconstructive form of Gödel's speed-up theoremeffective speedability of creative setsnumber of characters in the proofprovably recursive setsspeedable setstheorem of Hartmanis

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Complexity of proofs (03F20)

This page was built for publication: A Connection Between Blum Speedable Sets and Gödel's Speed-Up Theorem