The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
0 votes
8 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 (157 points) | 8 views

Please log in or register to answer this question.

No related questions found

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
49,411 questions
53,594 answers
185,831 comments
70,878 users