11 ms·

I doubt this is more accurate than humans are, or is that possible? Wouldn't an AI that can be a judge in a Turing test be able to pass the Turing test? Or is

I doubt this is more accurate than humans are, or is that possible? Wouldn't an AI that can be a judge in a Turing test be able to pass the Turing test? Or is this just testing how "real" the voice sounds?

nf05papsjfVbc 9y ago
Being able to classify things and being able to pretend to be one of those things are not the same. An oversimplified example: Being able to recognise someone and being able to draw a picture of their face (or pretending to be them) are not the same.
netsharc 9y ago
Presumably text-to-speech systems have signatures. For example how many milliseconds they need to pronounce each syllable of a particular word, say "watermelon". If the timings match for a whole sentence, this machine would probably be able to recognize that... an easy defeat would be a TTS engine that adds random milliseconds to each syllable.
- gargravarr 9y ago
  Thus begins the first TTS arms race. Yes, this is what will define 2017.
gargravarr 9y ago
> Wouldn't an AI that can be a judge in a Turing test be able to pass the Turing test? I changed my mind. I don't want the Red Pill anymore. Ignorance is bliss.
- djanatan 9y ago
  This is how I feel too. This is getting out of control.
  - beachbum8029 9y ago
    The best part is that we haven't yet seen a half of a percent of what AI's are capable of. Strap on your seat-belts because Kansas is going bye-bye.
wongarsu 9y ago
Well, deciding whether an array of arbitrary data is sorted can be done trivially in O(n). Sorting an unsorted array requires a much more complicated algorithm that runs in O(n log n) (or worse). I imagine computers would be able to do quite well at judging a turing test heuristically. Passing it is quite a different matter.
- balls187 9y ago
  > Sorting an unsorted array requires a much more complicated algorithm That is taught in every CS algorithm course.
  - wongarsu 9y ago
    Yes, every CS course teaches you multiple algorithms for sorting data. Most of them require extensive explanation to understand, and are very hard to come up with on your own.
Eridrus 9y ago
Humans are not perfect sensors; there are changes we are sensitive to and changes we are not. As a trivial example, if a speech synthesis system was emitting high frequency static, we wouldn't hear it at all, but would be trivial to detect with a microphone. I fully expect software to be better at this than we are if there ever turns out to be a need for this sort of thing.
philh 9y ago
> Wouldn't an AI that can be a judge in a Turing test be able to pass the Turing test? Not automatically, unless it had unlimited time and/or compute power. Verifying a potential solution seems to be much easier than generating a valid one. See also: P versus NP.

nf05papsjfVbc 9y ago

Being able to classify things and being able to pretend to be one of those things are not the same. An oversimplified example: Being able to recognise someone and being able to draw a picture of their face (or pretending to be them) are not the same.

netsharc 9y ago

Presumably text-to-speech systems have signatures. For example how many milliseconds they need to pronounce each syllable of a particular word, say "watermelon". If the timings match for a whole sentence, this machine would probably be able to recognize that... an easy defeat would be a TTS engine that adds random milliseconds to each syllable.

gargravarr 9y ago
Thus begins the first TTS arms race. Yes, this is what will define 2017.

gargravarr 9y ago

> Wouldn't an AI that can be a judge in a Turing test be able to pass the Turing test? I changed my mind. I don't want the Red Pill anymore. Ignorance is bliss.

djanatan 9y ago
This is how I feel too. This is getting out of control.
- beachbum8029 9y ago
  The best part is that we haven't yet seen a half of a percent of what AI's are capable of. Strap on your seat-belts because Kansas is going bye-bye.

wongarsu 9y ago

Well, deciding whether an array of arbitrary data is sorted can be done trivially in O(n). Sorting an unsorted array requires a much more complicated algorithm that runs in O(n log n) (or worse). I imagine computers would be able to do quite well at judging a turing test heuristically. Passing it is quite a different matter.

balls187 9y ago
> Sorting an unsorted array requires a much more complicated algorithm That is taught in every CS algorithm course.
- wongarsu 9y ago
  Yes, every CS course teaches you multiple algorithms for sorting data. Most of them require extensive explanation to understand, and are very hard to come up with on your own.

Eridrus 9y ago

Humans are not perfect sensors; there are changes we are sensitive to and changes we are not. As a trivial example, if a speech synthesis system was emitting high frequency static, we wouldn't hear it at all, but would be trivial to detect with a microphone. I fully expect software to be better at this than we are if there ever turns out to be a need for this sort of thing.

philh 9y ago

> Wouldn't an AI that can be a judge in a Turing test be able to pass the Turing test? Not automatically, unless it had unlimited time and/or compute power. Verifying a potential solution seems to be much easier than generating a valid one. See also: P versus NP.