15 ms·
> virtually guaranteed to be wrong I would go a step further and say all formal models are proven to be wrong. After all, that's what Gödel and Turing kept goi
by deckard1 7y ago
> virtually guaranteed to be wrong
I would go a step further and say all formal models are proven to be wrong. After all, that's what Gödel and Turing kept going on about.
We can't prove any non-trivial program ever halts or does not halt. In fact, we can't (or don't) prove much about our programs we run anywhere.
All programs are a collection of assumptions. To bring this back to the topic at hand, if all of our search assumptions are useful to some meaningful number of people then it really doesn't matter how many "falsehoods" we trip over. Those falsehoods fall away, becoming mere insignificant edge-cases. Satisfying all people all the time in all cases is a fool's errand.
Articles like this are good at letting you know your blindspots so you can choose your blindspots rather than succumb to them. But don't let it become dogma.
- dexen 7y ago>all formal models are proven to be wrong Your point certainly holds true for any physical entity as far as we know - probabilistic quantum effects, Heisenberg's Uncertainty, chaotic systems, and all that. However if you were to model a theoretical entity, and given a few more constraints (like strict computability, which precludes a turing-complete systems), you can indeed have correct models. Alas, in practice this is a rather rare example.