Insights Blog
-- Browse All Articles --
Physics Articles
Physics Tutorials
Physics Guides
Physics FAQ
Math Articles
Math Tutorials
Math Guides
Math FAQ
Education Articles
Education Guides
Bio/Chem Articles
Technology Guides
Computer Science Tutorials
Forums
Trending
Featured Threads
Log in
Register
What's new
Search
Search
Search titles only
By:
Menu
Log in
Register
Navigation
More options
Contact us
Close Menu
JavaScript is disabled. For a better experience, please enable JavaScript in your browser before proceeding.
You are using an out of date browser. It may not display this or other websites correctly.
You should upgrade or use an
alternative browser
.
Forums
The Lounge
General Discussion
Can the P vs NP Problem Explain the Mechanics of Comedy?
Reply to thread
Message
[QUOTE="andrewkirk, post: 5485822, member: 265790"] I don't know if this is the same topic but for some time I have felt that one of the quickest ways to make an Artificial Intelligence program fail the Turing test is via humour - tell it a joke and see if it 'gets' it, or ask it to make you laugh. When a computer can write a funny stand-up routine I will start to wonder whether computers are attaining consciousness. For all the hype about AI programs, we are currently so far away from computers being able to do that that it is unimaginable what level of complexity would be required for that to be achieved, and what a computer that could do that would be like. Comedy seems to me to be either uncomputable or, if not that, at an extremely high level of complexity. [/QUOTE]
Insert quotes…
Post reply
Forums
The Lounge
General Discussion
Can the P vs NP Problem Explain the Mechanics of Comedy?
Back
Top