The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
22 views
L = {<M> | M is a TM that accepts all even numbers }, How L Satisfies non-monotonicity ?? Explain
asked in Theory of Computation by Active (1.7k points) | 22 views
0
Ans given undecidable?? how??
0
No, it is non-RE , yaa Undecidable

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
47,928 questions
52,334 answers
182,380 comments
67,807 users