Timeline for addition of definable numbers decidable?
Current License: CC BY-SA 2.5
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 27, 2010 at 21:30 | history | edited | François G. Dorais | CC BY-SA 2.5 |
addendum
|
| Jan 27, 2010 at 20:43 | history | edited | François G. Dorais | CC BY-SA 2.5 |
correction
|
| Jan 27, 2010 at 20:40 | comment | added | Boris Bukh | Strictly speaking, this is not a solution to "More strongly" either, since $M$ and $M'$ are not given as black boxes, but as explicit Turing machines. The "more strongly" asks for an algorithm to construct a machine for $\alpha(M)+\alpha(M')$ given machines $M$ and $M'$. The basic question asks for non-constructive existence of such a machine for every pair $M,M'$. | |
| Jan 27, 2010 at 20:26 | comment | added | François G. Dorais | Good point. I didn't read the question carefully. | |
| Jan 27, 2010 at 20:20 | comment | added | Reid Barton | The first paragraph is only an answer to the "More strongly" part of the question, right? | |
| Jan 27, 2010 at 20:01 | history | answered | François G. Dorais | CC BY-SA 2.5 |