DITCHWALK

A Road Less Traveled

Topics / Books / Docs

About / Archive / Contact

Copyright © 2002-2023 Mark Barrett 

Home > ~ Tangents > The Ditchwalk Turing Test Coma Algorithm

The Ditchwalk Turing Test Coma Algorithm

June 16, 2014 By Mark Leave a Comment

On the heels of news that the Turing test has been successfully gamed passed, I would like to suggest a qualitative leap in such efforts. In order to defeat the Turing test with certainty I propose the creation of a computer program that replicates communication with a live human being in a coma.

In doing so I predict the following:

1) It will be impossible for anyone to distinguish the Ditchwalk Turing Test Coma Algorithm from a real human being in a coma.

2) Because the Ditchwalk Turing Test Coma Algorithm will not use scripts it will pass the most stringent interpretation of the Turing test.

3) Not only will the Ditchwalk Turing Test Coma Algorithm prove unbeatable using any technology currently available or any technology invented in the future, it will also prove unbeatable if we attempt to divine the real coma patient using telepathy, ESP, seances or other supernatural forms of communication.

Harry Houdini would be proud.

— Mark Barrett

Filed Under: ~ Tangents Tagged With: Turing Test

«   Turing Test Fail  |   Amazon Catches Fire   »

Comment Policy: Ditchwalk is a wild place, but not without tending. On-topic comments are welcomed, appreciated and preserved. Off-topic or noxious comments are, like invasive species, weeded out.

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *