3 ms·
It may be too difficult to build one of these directly, but it might be possible to build a machine that then builds a Gödel Machine.
by carapace 8y ago
It may be too difficult to build one of these directly, but it might be possible to build a machine that then builds a Gödel Machine.
- tekromancr 8y agoEven that's a stretch. I think you would need to build a machine that builds a machine that then builds a Gödel Machine.
- Anon84 8y agoSo... basically a Lisp machine?
- federicotdn 8y agoI think there's an Emacs mode for that.
- no_identd 8y agoNah, you need typed holes. Check out Hazel.org.
- jakethe____ 8y agometa-meta-learning
- squidbidness 8y agoWorth pointing out though that we do already know the answer: 42
- KingFelix 8y agoYes, so we would require a 3rd, maybe a 4th?
- joe_the_user 8y agoCoding an approximation to a Godel machine naively probably isn't that hard, relatively speaking - it would essentially be an extension to a symbolic computation system. What would be hard is running such a thing with any efficiency.
- carapace 8y agoSchmidhuber has a great talk where he sets up the GM then drops the boom on practical implementations (I forget the details, but the exponent is ~3000, an impossible lifetime-of-the-Universe search space) and the audience laughs, but then he also points out that the self-improvement search may well find massive speed-ups, and so it is perhaps not as hopeless as all that.