Recursiveness over the complex numbers is time-bounded

DOI10.1007/3-540-57529-4_59MaRDI QIDQ4268461zbMATH OpenFDO

Authors Felipe Cucker, Francesc Rosselló

Publication date 31 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-57529-4_59

zbMATH Keywords

complexity classescomputation theorytime bounded recursive sets

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• scientific article; zbMATH DE number 2013793
• A note on arbitrarily complex recursive functions
• scientific article; zbMATH DE number 4037837
• Recursion theory on the reals and continuous-time computation
• scientific article; zbMATH DE number 1850721
• TIME BOUNDED COMPUTATIONS OVER THE REALS
• A recursion theoretic foundation of computation over real numbers
• Polynomial time computation in the context of recursive analysis
• scientific article; zbMATH DE number 4006252
• scientific article; zbMATH DE number 2222029

Cited in

(2)

• TIME BOUNDED COMPUTATIONS OVER THE REALS
• Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time

This page was built for publication: Recursiveness over the complex numbers is time-bounded

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