The Gateway to Computer Science Excellence
0 votes
22 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.5k points) | 22 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,650 questions
56,238 answers
194,267 comments
95,876 users