Artificial Intelligence Stack Exchange is a question and answer site for people interested in conceptual questions about life and challenges in a world where "cognitive" functions can be mimicked in purely digital environment. It only takes a minute to sign up.
Very interesting question. Assuming that the programming languages used are powerful enough (say Turing Complete), all of the above actually should lead to an AGI. The difference is in how efficiently they can do it, both in term of number of computations required and in the length of the program.
So the question could be rephrased as: which approach cannot lead to an AGI using less than X resources and being shorter than Y characters?
The second question is basically asking the Kolmogorov complexity of the AGI in that language, which is uncomputable. Since we cannot find the shortest program, I don't think we can make conclusions about the maximum program efficiency either.
In summary I don't see a way to rule out any of those approaches (but I would be very happy to be proven wrong).