The applicability of \$-calculus to solve some Turing machine undecidable problems (Q4682579)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6938786
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The applicability of \$-calculus to solve some Turing machine undecidable problems |
scientific article; zbMATH DE number 6938786 |
Statements
18 September 2018
0 references
problem solving
0 references
hypercomputation
0 references
expressiveness
0 references
superTuring models of computation
0 references
resource bounded computation
0 references
process algebras
0 references
\$-calculus
0 references
0.8967975974082947
0 references
0.7384258508682251
0 references
0.7151145339012146
0 references
0.689414381980896
0 references
