Timeline for Where can I find the proof of the theorem and what is the computational complexity of the computably isomorphic map?
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
| Dec 12, 2014 at 1:14 | comment | added | XL _At_Here_There | "Which representations are appropriate for doing real number computations? We show that with respect to computable equivalence there is one and only one equivalence class of representations of the real numbers which make the basic operations computable."cited from : onlinelibrary.wiley.com/doi/10.1002/malq.19990450202/abstract, this possibly is the definition of "acceptable" | |
| Dec 11, 2014 at 15:08 | history | answered | Jason Rute | CC BY-SA 3.0 |