Register
Dark Mode

Self doubt

in Theory of Computation
308 views
0 votes
0 votes
L={ <TM>| L(TM)= not re} is it decidable or not if undecidable what specific  set it belongs ?
in Theory of Computation
by
308 views

4 Comments

Show 2 previous comments
by
oh..yes..totally missed this out.! thanks :)
0
0
by

@Somoshree Datta 5

L={ <TM>| L(TM)=  re} is also trivial. meaning its also decidable.

0
0
by
yes..
0
0

Please log in or register to answer this question.

← PreviousNext →
← Previous in categoryNext in category →

Related questions

Subscribe to GATE CSE 2024 Test Series

Subscribe to GO Classes for GATE CSE 2024

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

Subjects

64.3k questions

77.9k answers

244k comments

80.0k users

Developed by Chun
Link Copied!