The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
20 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 Active (1.6k points) | 20 views
0
Yes..

Please log in or register to answer this question.

Related questions

0 votes
0 answers
5
asked Dec 10, 2016 in Theory of Computation by KISHALAY DAS Loyal (6.6k points) | 269 views
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
47,913 questions
52,294 answers
182,250 comments
67,742 users