Skip to main content

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.

2
  • $\begingroup$ That is a great explanation of why we couldn't just give a simple construction that proves this separation. Thanks. What are reductions? $\endgroup$ Commented Sep 9, 2020 at 16:28
  • 1
    $\begingroup$ Reductions are a way of transforming one problem to another, in such a way that if one is known to be undecidable, then you can deduce the same for the other. You can read e.g. Sipser Chapter 5. Also, since you seem interested in this stuff, why not take a course (online or physical) about computability? There are many such courses, and since this stuff is being taught for some decades, the material is very polished and usually fun to listen to. $\endgroup$ Commented Sep 9, 2020 at 18:14