scientific article; zbMATH DE number 3619885

zbMath0399.03042MaRDI QIDQ4182501

Juris Hartmanis

Publication date: 1976

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

AlgorithmTheorem ProvingDecidableAxiomatizableComplexity of ProofsFormal TheoriesSpeed-Up

Mathematics Subject Classification ID

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

Related Items

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

Cites Work

• Unnamed Item
• Unnamed Item
• On Reducibility to Complex or Sparse Sets
• On Almost Everywhere Complex Recursive Functions
• On complexity properties of recursively enumerable sets
• A Machine-Independent Theory of the Complexity of Recursive Functions
• An Overview of the Theory of Computational Complexity