The Gateway to Computer Science Excellence
0 votes
5 views

In Theorem $3.21$, we showed that a language is Turing-recognizable iff some enumerator enumerates it. Why didn’t we use the following simpler algorithm for the forward direction of the proof? As before, $s_{1}, s_{2},\dots $ is a list of all strings in $\Sigma^{\ast}.$
$E = "$ Ignore the input.

  1. Repeat the following for $i = 1,2,3,\dots.$
  2. Run $M$ on $s_{i}.$
  3. If it accepts, print out $s_{i}."$ 
in Theory of Computation by Veteran (54.8k points) | 5 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,647 questions
56,492 answers
195,471 comments
100,768 users