scientific article
From MaRDI portal
Publication:3677732
zbMath0564.03008MaRDI QIDQ3677732
Publication date: 1984
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
halting problemsautomata-theoretical characterization of spectraminimal logical implementation of Turing machine programs
Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (4)
A uniform method for proving lower bounds on the computational complexity of logical theories ⋮ On some bandwidth restricted versions of the satisfiability problem of propositional CNF formulas ⋮ The structure of the models of decidable monadic theories of graphs ⋮ Some thoughts on computational models: from massive human computing to abstract state machines, and beyond
This page was built for publication:
