Yes. Modelspace is huge and we’re only exploring a smidgen. The busy beaver sequence hints at how much you can do with a small number of parts and exponential luck. I think feeding a random number generator into a compiler could theoretically have spawned an AGI in the eighties. Given a memory tape, transformers (and much simpler architectures) are Turing-complete. Even if all my reasoning is wrong, can’t the model just be hardcoded to output instructions on how to write an AGI?
Very clever! Yes I agree with you that there is a parameter setting for modern DRL architectures for an agent that has an “instinct” to walk over to the nearest computer, and write and execute code that turns on a real-deal superintelligent AGI. Or for a program that manually steps through the execution steps of an AGI Turing machine. I guess I interpreted the question to say that that kind of thing doesn’t count. :-P
Yes. Modelspace is huge and we’re only exploring a smidgen. The busy beaver sequence hints at how much you can do with a small number of parts and exponential luck. I think feeding a random number generator into a compiler could theoretically have spawned an AGI in the eighties. Given a memory tape, transformers (and much simpler architectures) are Turing-complete. Even if all my reasoning is wrong, can’t the model just be hardcoded to output instructions on how to write an AGI?
Very clever! Yes I agree with you that there is a parameter setting for modern DRL architectures for an agent that has an “instinct” to walk over to the nearest computer, and write and execute code that turns on a real-deal superintelligent AGI. Or for a program that manually steps through the execution steps of an AGI Turing machine. I guess I interpreted the question to say that that kind of thing doesn’t count. :-P