Here is a simple algorithm that passes Turing test:
(But mostly doesn't, with confidence much more reliable than the expected variability of any given Turing tester.)
Using quantum events, generate random bits and send them to output.
In some Everett branches this algorithm passes the test.
Incidentally the same algorithm (combined with some kind of synthesising device) can also create an actual living creature that we would expect (and desire) to pass such a test. This is just (even more) ridiculously unlikely (and/or occurs in less descendant Everett branches depending on nomenclature.)
I assume (and imply that it would be better) that you intent the 'random bits' part to be the important point more so than the 'quantum' part? Considering random 'passing' output reminds us that there are certain limits to the strength of the conclusions we can draw from such a test. The 'quantum' part just prevents distracting side-tracks like passing the buck to the pseudo-random number generator. ie. I would consider your point to be almost as strong even if the universe went around collapsing away those 'Everett branches' and you had to speak of "sometimes" instead of "In some Everett branches".
You are right. My point was that there are two ways how a "giant lookup table" could pass a Turing test.
a) It could be constructed by an enormous superhuman intelligence, in which case stop speaking about the table and show me the intelligence that created it.
b) It just got lucky... which proves nothing, because if you are lucky enough, you can pass the Turing test without the lookup table, just by sending random bits to the output.
There is a problem with the Turing test, practically and philosophically, and I would be willing to bet that the first entity to pass the test will not be conscious, or intelligent, or have whatever spark or quality the test is supposed to measure. And I hold this position while fully embracing materialism, and rejecting p-zombies or epiphenomenalism.
The problem is Campbell's law (or Goodhart's law):
This applies to more than social indicators. To illustrate, imagine that you were a school inspector, tasked with assessing the all-round education of a group of 14-year old students. You engage them on the French revolution and they respond with pertinent contrasts between the Montagnards and Girondins. Your quizzes about the properties of prime numbers are answered with impressive speed, and, when asked, they can all play quite passable pieces from "Die Zauberflöte".
You feel tempted to give them the seal of approval... but they you learn that the principal had been expecting your questions (you don't vary them much), and that, in fact, the whole school has spent the last three years doing nothing but studying 18th century France, number theory and Mozart operas - day after day after day. Now you're less impressed. You can still conclude that the students have some technical ability, but you can't assess their all-round level of education.
The Turing test functions in the same way. Imagine no-one had heard of the test, and someone created a putative AI, designing it to, say, track rats efficiently across the city. You sit this anti-rat-AI down and give it a Turing test - and, to your astonishment, it passes. You could now conclude that it was (very likely) a genuinely conscious or intelligent entity.
But this is not the case: nearly everyone's heard of the Turing test. So the first machines to pass will be dedicated systems, specifically designed to get through the test. Their whole setup will be constructed to maximise "passing the test", not to "being intelligent" or whatever we want the test to measure (the fact we have difficulty stating what exactly the test should be measuring shows the difficulty here).
Of course, this is a matter of degree, not of kind: a machine that passed the Turing test would still be rather nifty, and as the test got longer, and more complicated, as the interactions between subject and judge got more intricate, our confidence that we were facing a truly intelligence machine would increase.
But degree can go a long way. Watson won on Jeopardy without exhibiting any of the skills of a truly intelligent being - apart from one: answering Jeopardy questions. With the rise of big data and statistical algorithms, I would certainly rate it as plausible that we could create beings that are nearly perfectly conscious from a (textual) linguistic perspective. These "super-chatterbots" could only be identified as such with long and tedious effort. And yet they would demonstrate none of the other attributes of intelligence: chattering is all they're any good at (if you ask them to do any planning, for instance, they'll come up with designs that sound good but fail: they parrot back other people's plans with minimal modifications). These would be the closest plausible analogues to p-zombies.
The best way to avoid this is to create more varied analogues of the Turing test - and to keep them secret. Just as you keep the training set and the test set distinct in machine learning, you want to confront the putative AIs with quasi-Turing tests that their designers will not have encountered or planed for. Mix up the test conditions, add extra requirements, change what is being measured, do something completely different, be unfair: do things that a genuine intelligence would deal with, but an overtrained narrow statistical machine couldn't.