Re:Superintelligence cannot be contained: Lessons from Compu...
by sgillen on Tuesday January 12, 2021 @12:45PM
(#25750399)
I think maybe you made a typo in your OP? The authors assume beauty is decidable and use that to show that would imply that the halting problem is undecidable. It applies to anything, like you say, and to me it seems like a silly argument, but I think it’s a valid proof given the premises.
[ Parent
| on HN ]
There are no comments on this comment yet.