scientific article
From MaRDI portal
Publication:3037403
zbMath0524.03026MaRDI QIDQ3037403
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
independenceconsistencyautomata theoryPeano arithmeticindicatorfinite-state automatondeterministic Turing machinesP=NP problemtrue sentence
Analysis of algorithms and problem complexity (68Q25) Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Consistency and independence results (03E35) Turing machines and related notions (03D10) Nonstandard models (03H99)
Related Items (2)
This page was built for publication: