{'fraction_non_alphanumeric': 0.029596100278551533, 'fraction_numerical': 0.0020891364902506965, 'mean_word_length': 4.746, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
If it walks like a duck and quacks like a duck... The Turing Test, Intelligence and Consciousness

"If it walks like a duck and quacks like a duck, it probably is a duck." So goes a pithy observation, undoubtedly as old as English itself, that provides a quick-and-dirty way to recognize ducks. This little maxim constitutes an operational definition of a duck that, for better or for worse, sidesteps all the thorny issues associated with actually explicitly defining one (e.g., has feathers, can fly, weighs less than 10 pounds, has webbed feet, swims well, has nucleated red blood cells, has a four-chambered heart, has a flat bill, etc.). What folk wisdom did for ducks, Alan Turing did for intelligence. He was the first to suggest an operational definition of intelligence that has come to be called the Turing Test (Turing, 1950). The underlying idea of his Test is the same as our folk means of duck identification, viz., whatever acts sufficiently intelligent is intelligent. Translated into the vernacular of modern electronic communication, the Turing Test says that if, by means of an extended e-chat alone, you cannot tell whether you are chatting with a machine or a person, then whomever or whatever you are chatting with is intelligent. Since it first appeared nearly six decades ago, Turing's article has become the single most cited article in artificial intelligence. In fact, few articles in any field have caused so much ink to flow. References to the Turing Test still appear regularly in artificial intelligence journals, philosophy journals, technical treatises, novels and the popular press. Type "Turing Test" into any internet search engine and there will be, literally, thousands of hits. How the Turing Test Works Turing's original description of his "Imitation Game" was somewhat more complicated than the simpler version that we describe below. However, there is essentially universal agreement that the additional complexity of the original version adds nothing of substance to its slightly simplified reformulation that we refer to today as the Turing Test. The Turing Test starts by supposing that there are two rooms, one of which contains a person, the other a computer. Both rooms are linked by means of text-only communication to an Interrogator whose job it is, by means of questioning the entities in each room, to determine which room contains the computer and which the person. Any and all questions that can be transmitted via typed text are fair game. If after a lengthy session of no-holds- barred questions, the Interrogator cannot distinguish the computer from the person, then the computer is declared to be intelligent. It is important to note that failing the Turing Test proves nothing. It is designed to be a sufficient, but not necessary, condition for intelligence. Commentary on the Turing Test: two lines of argument