The Game of Go has been explored for 2500 years and resulted in a body of theories that Go masters study in Go schools. Alpha Go discovered that human Go understanding was caught in a local optimum, and broke out of it. The game of modern physics started only 130 years ago...
-
-
Replying to @Plinz @gegarciaar
physics is not a game with rules, it is about discovering the rules of the game.
2 replies 1 retweet 28 likes -
Replying to @SergioFelperin @gegarciaar
Consider the Atari player that preceeded Alpha Go: it was not given the rules of Donkey Kong either. We are always approximating a function to optimize some loss criterion; it does not matter if the loss represents game score, prediction accuracy or model size etc
2 replies 0 retweets 2 likes -
Replying to @Plinz @gegarciaar
in more metaphorical terms: can an algorithm find alexander's solution to the gordian knot problem?
2 replies 0 retweets 1 like -
Replying to @SergioFelperin @gegarciaar
That is exactly the problem with metaphors. If you don't compile them into cold hard computable functions they may lead you astray without giving you a chance to notice it.
2 replies 1 retweet 5 likes -
Replying to @Plinz @gegarciaar
Ok, so we should not talk about non-computable problems :) This conversation is getting ridiculous.
1 reply 0 retweets 0 likes -
Replying to @SergioFelperin @gegarciaar
Using non formal language is a problem when your underlying formalization is not clear. For instance, you cannot just throw the term "non-computable" problem around if you don't have a computable notion of its meaning. It just increases confusion.
1 reply 0 retweets 0 likes -
Replying to @Plinz @gegarciaar
what happens when your underlying formalizations is clear, but you cannot prove it is consistent?
1 reply 0 retweets 0 likes
If your formalization concerns a system that can actually be implemented, it will always have to be consistent. Our universe must arguably be implemented somehow, so a clear formalization of physics must be provably non contradictory.
-
-
You have no idea if our universe is computable.
1 reply 0 retweets 0 likes -
Its almost certainly computational, quite certainly universally Turing computable, and some say it might be hypercomputational. What else it is on top of this we cannot know.
1 reply 0 retweets 0 likes - 1 more reply
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.