I need to prove that natural numbers are Turing recognizable. How do I start? I understand the basic definition of Turing recognizable and Turing decidable, but am having a hard time applying it to proofs
Asked
Active
Viewed 172 times
0
-
2`How do I start?` Probably not on StackOverflow. – admdrew Feb 11 '14 at 19:12
-
Describe an algorithm that recognizes them. – Paul Feb 11 '14 at 19:15
-
1Are there any other sites that can help me with what I need? – user3277633 Feb 11 '14 at 19:24