What can be computed? A practical guide to the theory of computation (Q4642339)
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: What can be computed? A practical guide to the theory of computation |
scientific article; zbMATH DE number 6871256
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | What can be computed? A practical guide to the theory of computation |
scientific article; zbMATH DE number 6871256 |
Statements
22 May 2018
0 references
tractable problems
0 references
intractable problems
0 references
uncomputable problems
0 references
Python programs
0 references
Turing machines
0 references
reductions
0 references
finite automata
0 references
computational complexity
0 references
computational problems
0 references
computability theory
0 references
0.8198632597923279
0 references