\(\delta\)-uniform BSS machines
type: Item
instance of: scholarly article
title: \(\delta\)-uniform BSS machines
zbMATH Open document ID: 0919.68039
author: Paolo Boldi
author: Sebastiano Vigna
published in: Journal of Complexity
publication date: 1998-11-11T00:00:00Z
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 1221705
zbMATH Keywords: \(\delta\)-uniform decidability
zbMATH Keywords: Turing model
MaRDI profile type: Publication
full work available at URL: jcom.1998.0475
OpenAlex ID: W1999405008
cites work: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
cites work: Real functions and numbers defined by Turing machines
cites work: Q5327703
cites work: Reducibilities on real numbers
cites work: Q4002474
cites work: Theory of representations
cites work: On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
cites work: Recursive Real Numbers
cites work: Q5656753
cites work: Recursion Theory and Dedekind Cuts
cites work: Q5625295
cites work: Type 2 recursion theory
cites work: Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine
DOI: 10.1006/JCOM.1998.0475
description: scientific article; zbMATH DE number 1221705