Talk:Gödel machine
Add topic| This article is rated C-class on Wikipedia's content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||||||||||||
| ||||||||||||||||||||||||
"more optimal" - surely this is an oxymoron!79.67.251.252 (talk) 20:19, 11 December 2014 (UTC)
Does the "LessWrong" blog really count as an acceptable source for Wikipedia? GreatBigDot (talk) 20:51, 13 June 2017 (UTC)
Re Limitations: "Any formal system that encompasses arithmetic is either flawed or allows for unprovable but true statements.[3] Hence even a Gödel machine with unlimited computational resources must ignore those self-improvements whose effectiveness it cannot prove" Is this correct? conflates provability with effectiveness, why would the Godel machine care about provability if it's goal is optimization? — Preceding unsigned comment added by 74.79.133.106 (talk) 23:40, 5 March 2019 (UTC)
- C-Class Computing articles
- Low-importance Computing articles
- C-Class software articles
- Low-importance software articles
- C-Class software articles of Low-importance
- All Software articles
- All Computing articles
- C-Class Artificial Intelligence articles
- Unknown-importance Artificial Intelligence articles
- WikiProject Artificial Intelligence articles
