The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
17 views
is it true that:-

1) turing decidable languages are recursive languages.

2) turing recognizable languages are recursive enumerable.
asked in Theory of Computation by Junior (873 points) | 17 views
0
Yes..

Please log in or register to answer this question.



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

38,054 questions
45,546 answers
131,866 comments
48,888 users