Bulletin of the American Mathematical Society Β· 19891,062 citations
On a theory of computation and complexity over the real numbers: ππ- completeness, recursive functions and universal machines
Lenore Blum, M. Shub, Steve Smale
0discussions
A lightweight one-liner about this paper β for when it isn't a full discussion. Start a discussion instead if it needs back-and-forth.
No quick takes yet. Be the first to leave one.
Ask a question, share a critique, or post a reproduction note.
No related papers yet β they'll appear as the catalog grows.