4 ms·
Unknowable. And no, you'll have no way to break out of simulation and access api of the simulator, because if it's in place it works similarly to this: https:
by scotty79 5y ago
Unknowable.
And no, you'll have no way to break out of simulation and access api of the simulator, because if it's in place it works similarly to this:
https://m.youtube.com/watch?v=xP5-iIeKXE8 https://m.youtube.com/watch?v=xP5-iIeKXE8
- fabiospampinato 5y agoNot necessarily, there might be bugs in it.
- krustyburger 5y agoWell, we know there are bugs in this reality. I believe the relevant field of study is called entomology.
- scotty79 5y agoSure, because gods that made math are known to be crappy developers. ;-)
- fabiospampinato 5y agoYou don't need to be crappy to make something that isn't perfect, maybe it's not even possible to prove that something extremely complicated like the universe is bug-free. Obviously though it might be a matter of perspective, we might as well be gods compared to ants, our code might be buggy but I don't think ants are smart enough to figure that out.
- scotty79 5y agoComplexity of the universe comes from super simple (relatively for gods) rules of math. You don't have bugs in math.
- fabiospampinato 5y agoThere's actually a math theorem that says basically that, unless I'm misunderstanding, if your math has no bugs you can't prove it has no bugs with it.
- scotty79 5y agoNot quite. It just says that if you assume set of axioms and math grammar you may generate statements that are not false but you can't constructa a proof with what you allowed yourself. I don't think it's a bug.
- fabiospampinato 5y agoI think that's another theorem.
- scotty79 5y agoDunno, I thought you were refering to Godel's theorem.
- fabiospampinato 5y agoYes I think you were referring to the first incompleteness theorem while I was referring to the second one: https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_theorems https://en.wikipedia.org/wiki/G%C3%B6del%27s_incompleteness_... > The second incompleteness theorem, an extension of the first, shows that the system cannot demonstrate its own consistency.
- scotty79 5y agoThis one just says that any non-trivial consistent set of math doesn't contain the proof of its consistency. Where consistency means it doesn't contain proofs of falsehoods. It doesn't seem like a bug to me. Just a way to ensure that any non-trivial math has no self sufficient bubbles. That no set of math is somehow better than others. That math is free and unlimited with it's choice of axioms and rules and no subset is better than others.