This isn’t arguing other side, just a request for clarification:
There are some Turing machines that we don’t know and can’t prove if they halt. There are some that are sufficiently simple that we can show that they halt.
But why dors the discussion encompass the question of all possible Turing machines and their maps? Why isn’t it sufficient to discuss the subset which are tractable within some compute threshold?
This isn’t arguing other side, just a request for clarification:
There are some Turing machines that we don’t know and can’t prove if they halt. There are some that are sufficiently simple that we can show that they halt.
But why dors the discussion encompass the question of all possible Turing machines and their maps? Why isn’t it sufficient to discuss the subset which are tractable within some compute threshold?