decidable - Given the encoding of a specific Turing machine, can it be decided if it will halt on a specific input? -


say have universal turing machine encoding of specific turing machine t. have encoding of specific input s. question of whether t halts on s decidable? can simulating running t on s used reach answer?

this problem decidable in instances. specific, fixed tm either halts or doesn't on specific, fixed input, assuming moment excluded middle not want challenge here. specific instance of problem fixing tm , input, tm should either halt-accept inputs (not specific, fixed input parameterizing problem, typical input tm solve our parameterized problem) if specific instance if problem has tm halting on supplied input, or should halt-reject if specific instance has tm fails halt.

the difficulty specific instance of problem, know specific tm either halts or doesn't given specific input, don't have computationally effective way know case. 1 or other (again, whether accept excluded middle larger discussion) , therefore specific instance of problem decidable - regular, - doesn't much, except understand computability little better.

note there lots of instances of problem know of 2 cases holds; instance, not hard produce tms halt, or fail halt, on or inputs. instances of problem not decidable , regular, know decidable/regular languages are.


Comments

Popular posts from this blog

php - Vagrant up error - Uncaught Reflection Exception: Class DOMDocument does not exist -

vue.js - Create hooks for automated testing -

Add new key value to json node in java -