Decidability and universality in the axiomatic theory of computability and algorithms (Q4923291)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Decidability and universality in the axiomatic theory of computability and algorithms |
scientific article; zbMATH DE number 6171176
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7481235861778259
0 references
0.7417030334472656
0 references
0.7303047776222229
0 references
