496 views

2 Answers

Best answer
2 votes
2 votes
It is decidable as it will stop after K steps whatever K might be,halting machine is recursive hence decidable
selected by
0 votes
0 votes

According to me the language is undecidable. Reason being machine will accept the string in “k” steps and will halt but when rejecting it can/ cannot halt. Hence clearly partially decidable. But since they asked about decidable/undecidable so I will conclude it undecidable. 

Related questions