A language $L \subseteq \Sigma^*$ is unary if $|\Sigma| = 1$. Show that there is a unary language that is not Turing recognizable.
Added by Rebecca Y.
Close
Step 1
This language consists of strings of 0's where the length of the string is a prime number. Show more…
Show all steps
Your feedback will help us improve your experience
Madhur L and 92 other AP CS educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Let A be a Turing-recognizable language consisting of descriptions of Turing machines, (M1), (M2), ..., where every Mi is a decider. Prove that some decidable language D is not decided by any decider Mi whose description appears in A. (Hint: Use diagonalization and consider an enumerator for A.)
Madhur L.
Show that the function $B(n)$ cannot be computed by any Turing machine. [Hint: Assume that there is a Turing ma- chine that computes $B(n)$ in binary. Build a Turing ma- chine $T$ that, starting with a blank tape, writes $n$ down in binary, computes $B(n)$ in binary, and converts $B(n)$ from binary, computes $B(n)$ in binary, and converts $B(n)$ from binary to unary. Show that for sufficiently large $n,$ the number of states of $T$ is less than $B(n)$ , leading to a contradiction. $]$
Modeling Computation
Turing Machines
Akash M.
Recommended Textbooks
Computer Science and Information Technology
Introduction to Programming Using Python
Computer Science - An Overview
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD