The Gateway to Computer Science Excellence
0 votes
23 views
is it true that:-

1) turing decidable languages are recursive languages.

2) turing recognizable languages are recursive enumerable.
in Theory of Computation by Active (1.6k points) | 23 views
0
Yes..

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,833 questions
57,742 answers
199,469 comments
108,050 users