On the relations between distributive computability and the BSS model

DOI10.1016/0304-3975(95)00247-2MaRDI QIDQ1349919zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1827830
• scientific article; zbMATH DE number 1746041
• A survey on real structural complexity theory

Cites work

• scientific article; zbMATH DE number 19492 (Why is no real title available?)
• scientific article; zbMATH DE number 4114603 (Why is no real title available?)
• A note on recursive functions
• An imperative language based on distributive categories
• An imperative language based on distributive categories II
• Introduction to extensive and distributive categories
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines

Cited in

(2)

• An algebra of automata that includes both classical and quantum entities
• scientific article; zbMATH DE number 1827830 (Why is no real title available?)

This page was built for publication: On the relations between distributive computability and the BSS model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1349919)