DECIDABILITY AND UNIVERSALITY IN THE AXIOMATIC THEORY OF COMPUTABILITY AND ALGORITHMS

DOI10.1142/S012905411240059XzbMath1279.03068OpenAlexW2139765337MaRDI QIDQ4923291

Mark S. Burgin

Publication date: 6 June 2013

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s012905411240059x

zbMATH Keywords

Turing machinesuniversalitydecidabilityprimitive recursive functionsaxiomatic theory of computability, automata and algorithmsundecidability of algorithmic problems

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Abstract and axiomatic computability and recursion theory (03D75)

Cites Work

• Operator composition in a multidimensional structurally oriented model of parallel computations and systems

This page was built for publication: DECIDABILITY AND UNIVERSALITY IN THE AXIOMATIC THEORY OF COMPUTABILITY AND ALGORITHMS