Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine (Q1128664)
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: Recursively enumerable subsets of R^q in two computing models Blum-Shub-Smale machine and Turing machine |
scientific article; zbMATH DE number 1189926
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine |
scientific article; zbMATH DE number 1189926 |
Statements
Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine (English)
0 references
13 August 1998
0 references
Blum-Shub-smale machine
0 references
Turing computing model
0 references
0.7928000688552856
0 references
0.7635610699653625
0 references
0.7589241862297058
0 references
0.7575975060462952
0 references
