4 ms·
Determining whether something is useful because it’s the only way that a problem can be solved is quite a high bar. We could say the same about computers in ge
by dambi0 2y ago
Determining whether something is useful because it’s the only way that a problem can be solved is quite a high bar.
We could say the same about computers in general.
Admittedly even with a less stringent criteria I don’t have any examples. So I understand your point
- Krei-se 2y agoBrainfuck is turing complete, why would we worry about any other structure preserving compilers? Brainfuck will do just fine /s CT is outside most problem domains in computation, as its outside the time and space constraints of a machine. Knowing whether a program will never finish is part of CT for software developers. So handling this case is a maybe in CT while it's a must in software (running endlessly means crashing).