3 ms·
This is a well studied problem from the days of Turing. Named slightly differently as the Halting Problem, the question of whether Vim will stop for a given arb
by astatine 7y ago
This is a well studied problem from the days of Turing. Named slightly differently as the Halting Problem, the question of whether Vim will stop for a given arbitrary input has been proven by Turing [https://en.m.wikipedia.org/wiki/Halting_problem https://en.m.wikipedia.org/wiki/Halting_problem] to be unsolvable.