3 ms·

How is constitutional law subject to Goedel's Incompleteness Theorem? Everything is computer science, or at least linearly transformable into computer science.

• setr 6y ago
  halting problem doesn't say you can't prove a program halts; it says you can't write a program to prove every program halts (or doesn't), because you can construct pathological programs to intentionally foil it. you can certainly prove some programs halt, or don't. int main(){ return 0; } int main(){ while(true){} } and presumably, the constitution has not been written in such a way that it cannot be proven halt-able, one way or the other. In which case, it's finite, and all paths can be evaluated