Is that always true ? I know nothing about AI whatsoever but wouldn’t the function have to satisfy certain properties for a NN to be able to learn from it? Properties that the discussed “3D verifier function “ wouldn’t necessarily have?
It sounds very much like complexity theory, where you definitely have problems that are easier to verify than solve (see NP hard).
(Otherwise I could do stuff like use a hash function to train a NN to compute input for hashes , for example, no?)
It sounds very much like complexity theory, where you definitely have problems that are easier to verify than solve (see NP hard).
(Otherwise I could do stuff like use a hash function to train a NN to compute input for hashes , for example, no?)