As a computer science theorist, I want to thank Japanese polices · Issue #47 · hamukazu/lets-get-arrestedtl;dr: Japanese polices have just solved the halting problem Background Definition: Halting problem is: Given any Turing Machine M and an input s, decide whether M(s) halts. In common words, halting problem is saying, given a program, and some inputs, determining whether the program exits at all. In 1936, Alan Turing proved that there is no hope we can write a program to solve such a problem. But
