| Display title | Blum–Shub–Smale machine |
| Default sort key | Blum-Shub-Smale machine |
| Page length (in bytes) | 4,736 |
| Namespace ID | 0 |
| Page ID | 226978 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>John Marlo |
| Date of page creation | 14:43, 6 February 2024 |
| Latest editor | imported>John Marlo |
| Date of latest edit | 14:43, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In computation theory, the Blum–Shub–Smale machine, or BSS machine, is a model of computation introduced by Lenore Blum, Michael Shub and Stephen Smale, intended to describe computations over the real numbers. Essentially, a BSS machine is a Random Access Machine with registers that can store arbitrary... |
