scientific article; zbMATH DE number 3619885

MaRDI QIDQ4182501zbMATH OpenFDO

Authors J. Hartmanis

Publication date 1976

Full work available at URL https://eudml.org/doc/92026

zbMATH Keywords

AlgorithmAxiomatizableComplexity of ProofsDecidableFormal TheoriesSpeed-UpTheorem Proving

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Complexity of proofs (03F20)

Cites work

• A Machine-Independent Theory of the Complexity of Recursive Functions
• An Overview of the Theory of Computational Complexity
• scientific article; zbMATH DE number 3501006 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• On Almost Everywhere Complex Recursive Functions
• On complexity properties of recursively enumerable sets
• On Reducibility to Complex or Sparse Sets

Cited in

(2)

• Fermat's last theorem and chaoticity
• On Goedel speed-up and succinctness of language representations

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4182501)