Edit - MathOverflow

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

Rev

10

$\begingroup$ I believe that the result "randomness doesn't help computability" goes back to a 1956 paper, "Computability by probabilistic machines" by K. de Leeuw, E.F. Moore, C.E. Shannon, and N. Shapiro [in "Automata Studies" Princeton Univ. Press, pp. 183-212]. In modern set-theoretic terminology, the result can be phrased as "any ground model real that is recursive relative to a random (over that ground model) real is in fact recursive." $\endgroup$

Andreas Blass
– Andreas Blass

2011-03-10 13:42:43 +00:00
Commented Mar 10, 2011 at 13:42

Add a comment |

Correct minor typos or mistakes
Clarify meaning without changing it
Add related resources or links
Always respect the author’s intent
Don’t use edits to reply to the author

create code fences with backticks ` or tildes ~
```
like so
```
add language identifier to highlight code
```python
def function(foo):
print(foo)
```
put returns between paragraphs
for linebreak add 2 spaces at end
_italic_ or **bold**
quote by placing > at start of line
to make links (use https whenever possible)

<https://example.com>

[example](https://example.com)

<a href="https://example.com">example</a>
MathJax equations $\sin^2 \theta$

formatting help »
answering help »

MathJax help »