The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
4 views
Can anyone explain how to reduce halting problem of TM (HTM) to acceptance problem of TM (ATM).....to prove ATM is undecidable because HTM is undecidable.......

Thanks in Advance!!
asked in Theory of Computation by (119 points) | 4 views

Please log in or register to answer this question.



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

41,069 questions
47,669 answers
147,406 comments
62,387 users