Hacker News new | ask | show | jobs
by ilaksh 4835 days ago
"an AI performing Bayesian inference over a hypothesis class of all potential environment-generating computer programs, with a Kolmogorov complexity prior, -- is wildly uncomputable, so to make it practical we'd need to find simple, computable approximations that work on real problems"

That's not what AGI is trying to do or how they are trying to do it.

1 comments

It's at least one way which has been advocated by leading researcher of the field. If you think differently, you should give references and explain what your AGI definition is.