On the relations between distributive computability and the BSS model

DOI10.1016/0304-3975(95)00247-2zbMath0871.68078OpenAlexW1969367420MaRDI QIDQ1349919

Sebastiano Vigna

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)00247-2

zbMATH Keywords

Blum-Shub-Smale model

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items

An Algebra of Automata That Includes Both Classical and Quantum Entities

Cites Work

• Unnamed Item
• Unnamed Item
• Introduction to extensive and distributive categories
• An imperative language based on distributive categories
• An imperative language based on distributive categories II
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• A note on recursive functions