Pages that link to "Item:Q1128664"
From MaRDI portal
The following pages link to Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine (Q1128664):
Displaying 6 items.
- The connection between computability of a nonlinear problem and its linearization: the Hartman-Grobman theorem revisited (Q714846) (← links)
- \(\delta\)-uniform BSS machines (Q1271171) (← links)
- Computability on subsets of Euclidean space. I: Closed and compact subsets (Q1292398) (← links)
- On approximate and algebraic computability over the real numbers (Q1292404) (← links)
- A topological view on algebraic computation models (Q1679677) (← links)
- Computing eigenvalues of the Laplacian on rough domains (Q6076240) (← links)
