Earlier quoted context omitted.
No I am not assuming anything other that what you wrote. Consider an AI to be a chat program which maps strings to strings I could just as well have written a chat program that for any question (including this), merely looked up the correct form of an answer (wrong or not) without attempting to run anything. But before any kind of meaningful conversation can continue I need to know what your definition of Strong AI i…
> "I am not assuming anything other that what you wrote" Yes you are: > "it works just as well to consider humans to be char programs which map strings to strings." Before proceeding, I will assume you're familiar with the distinction between countable and uncountable infinities, and the Cantor Diagonalization proof [0]. This argument is simply a special case of that. Mapping strings to strings is an uncountable infi…
Why? I do not see why a strong AI must be able to construct any string mapping whatsoever. And for the reason that conversations have lengths that are bounded (as per the quote) we can know that the AI's string look up table will be finite.
"We do not know whether human programming is enumerable; thus, we cannot draw the analogy you attempted to draw."
My argument is only that there is an abstraction where you can view humans as a black box that takes a string and outputs a string. But I see the problem now, you are right in that I treat the CTT as true so I don't even notice when I am assuming the human black box is not something like a hypercomputer. But it is simpler to believe that humans are not something exotic like a hypercomputer than to believe they are.