0 votes 0 votes 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. Theory of Computation peter-linz peter-linz-edition5 theory-of-computation proof turing-machine recursive-and-recursively-enumerable-languages + – Rishi yadav asked Mar 16, 2019 recategorized Mar 16, 2019 by Rishi yadav Rishi yadav 197 views answer comment Share Follow See 1 comment See all 1 1 comment reply abhishekmehta4u commented Mar 17, 2019 reply Follow Share It says " turing machine that enumrates the element of L in proper order " . i.e in lexicographic order ??? 0 votes 0 votes Please log in or register to add a comment.