The Gateway to Computer Science Excellence
0 votes
13 views
Suppose that $L$ is such that there exists a Turing machine that enumerates the elements of $L$ in proper order. Show that this means that $L$ is recursive.
in Theory of Computation by Boss (11.7k points)
recategorized by | 13 views
0
It says " turing machine that enumrates the element of L in proper order " .

i.e in lexicographic order ???

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,737 questions
57,352 answers
198,471 comments
105,244 users