| comex on Sat, 24 Aug 2013 13:52:24 -0700 (MST) |
[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]
| Re: [s-d] [s-b] nday 2: The State of Play |
On Sat, Aug 24, 2013 at 4:37 PM, Kerim Aydin <kerim@xxxxxxxxxxxxxxxx> wrote: > On Sat, 24 Aug 2013, Jamie Ahloy Dallaire wrote: >> I agree with comex. turing.py certainly -can- pass at least "a" Turing Test >> of some sort, at least once in 10^something times. > > The rule itself can be read either "there is at least one > carefully constructed Turing Test that turing.py can pass" OR > "turing.py can [in general] pass a generally reasonable version > of a Turing Test". I am suggesting an interpretation in the middle: "turing.py can [occasionally] pass a generally reasonable version of a Turing Test". That is, e is capable of passing a Turing test in the same way I am capable of winning the lottery. _______________________________________________ spoon-discuss mailing list spoon-discuss@xxxxxxxxx http://lists.ellipsis.cx/mailman/listinfo/spoon-discuss