A Turing machine simulated with finite resources is decidable by a Turing machine, so the halting problem isn’t a problem, though in this case the simulator also has finite resources, so infinite loops aren’t a problem.
A Turing machine simulated with finite resources is decidable by a Turing machine, so the halting problem isn’t a problem, though in this case the simulator also has finite resources, so infinite loops aren’t a problem.