Recent questions tagged theorem

0 votes

0 answers

Rice theorem problem
Problem : It is undecidable whether an arbitrary Turing Machines halt within 10 steps? Let consider Two Turing machine in which first one it is halt in 10 steps while in other it is not , so as it is undecidable. @arjun sir ,@bikram sir or @others

Problem : It is undecidable whether an arbitrary Turing Machines halt within 10 steps?Let consider Two Turing machine in which first one it is halt in 10 steps while in o...

hem chandra joshi

1.1k views

hem chandra joshi asked Dec 1, 2017

2 votes

1 answer

Rice Theorem
L(M)=RL(Recursive Language) ... M is a TM... Question/Doubt:- L(m) is decidable or not (Explain by the concept of Rice Theorem)???

L(M)=RL(Recursive Language) ...M is a TM...Question/Doubt:-L(m) is decidable or not (Explain by the concept of Rice Theorem)???

hs_yadav

658 views

hs_yadav asked Oct 6, 2017

To see more, click for the full list of questions or popular tags.

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