Robin Z: What we are looking for, however, is, by the Church-Turing thesis, an algorithm, an information-processing algorithm, and I invite the computer scientists et al. here to name any known information-processing algorithm which doesn’t scale.
Assuming P != NP, no algorithm for an NP-hard problem scales. That is what makes them NP-hard.
Given that intelligent beings exist, that can be taken as evidence that AI does not require solving NP-hard problems. But NP-hard or not, nothing in the history of AI research has ever scaled up from toy problems to human level, never mind beyond, except for a few specialised party tricks like Deep Thought (the chess player). If it had, we would already have strong AI.
Robin Z: What we are looking for, however, is, by the Church-Turing thesis, an algorithm, an information-processing algorithm, and I invite the computer scientists et al. here to name any known information-processing algorithm which doesn’t scale.
Assuming P != NP, no algorithm for an NP-hard problem scales. That is what makes them NP-hard.
Given that intelligent beings exist, that can be taken as evidence that AI does not require solving NP-hard problems. But NP-hard or not, nothing in the history of AI research has ever scaled up from toy problems to human level, never mind beyond, except for a few specialised party tricks like Deep Thought (the chess player). If it had, we would already have strong AI.