Question
Prove that there are unary relations over $\mathbf{N}$ that are not Turing computable.
Step 1
A unary relation over $\mathbf{N}$ (the set of natural numbers) is a subset of $\mathbf{N}$. For example, the set of all even numbers is a unary relation over $\mathbf{N}$. Show more…
Show all steps
Your feedback will help us improve your experience
100,000+
Students learning Computer Science with Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD