DECIDABILITY AND UNIVERSALITY IN THE AXIOMATIC THEORY OF COMPUTABILITY AND ALGORITHMS (Q4923291)
From MaRDI portal
scientific article; zbMATH DE number 6171176
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | DECIDABILITY AND UNIVERSALITY IN THE AXIOMATIC THEORY OF COMPUTABILITY AND ALGORITHMS |
scientific article; zbMATH DE number 6171176 |
Statements
DECIDABILITY AND UNIVERSALITY IN THE AXIOMATIC THEORY OF COMPUTABILITY AND ALGORITHMS (English)
0 references
6 June 2013
0 references
decidability
0 references
universality
0 references
axiomatic theory of computability, automata and algorithms
0 references
undecidability of algorithmic problems
0 references
Turing machines
0 references
primitive recursive functions
0 references
