Turing Test passed by a Computer ! - Amazing

Replies

• 

  Kaustubh Katdare

  Just read the story. But I'm not excited. Can someone explain why is this news so important and why is cracking the Turing test a big thing?
  
  PS: I can obviously go and read about it on Wikipedia; but all I'm looking for is a small explanation. 😀
• 

  avii

  ^simply put, it means the computer is as intelligent as humans. can make decisions on own and act accordingly.
  
  Computer is dumber than the dumbest human, even if he has -ve IQ.
• 

  Sanyam Khurana

  #-Link-Snipped-# What excites me is, with this, we can also expect the famous P NP problems solved. They have always been in news, various organizations have put up bounties for people to solve it.
  
  Research it..
  
  PS : I would've given all links here, but having exams :/
• 

  Pensu

  Check this out:
  
  #-Link-Snipped-#
  
  I have had my reservation about this story since the day it came out. It's not the first time I am hearing this, plus it wasn't even the "original" turing test! I agree with what the article says, chatbots have been there for a long time and most of them have manged to deceive people before!
• 

  avii

  Sanyam Khurana

  What excites me is, with this, we can also expect the famous P NP problems solved.

  How?
• 

  Sanyam Khurana

  avii

  How?

  I'm not sure, but I think now we're one step closer to solve that.
• 

  avii

  Sanyam Khurana

  I'm not sure, but I think now we're one step closer to solve that.

  Do you understand what is the meaning of P vs NP problem? 😛
• 

  Sanyam Khurana

  avii

  Do you understand what is the meaning of P vs NP problem? 😛

  hmm...yes. But I'm not sure, may be I'm wrong about it.
  
  but yes I know about P NP problems.
  
  May be you can help me learn more 😀
• 

  avii

  Sanyam Khurana

  hmm...yes. But I'm not sure, may be I'm wrong about it.
  
  but yes I know about P NP problems.
  
  May be you can help me learn more 😀

  There is a jar filled with many different chocolates. You can verify whether your favorite chocolate is there or not, by simple Yes, my chocolate exists or No. But can you find it?
  
  Son, this is the P vs NP problem.
• 

  Sanyam Khurana

  avii

  There is a jar filled with many different chocolates. You can verify whether your favorite chocolate is there or not, by simple Yes, my chocolate exists or No. But can you find it?
  
  Son, this is the P vs NP problem.

  Yeah, I know, P are the problems that can be solved in Polynomial time, and NP refers to non-deterministic Polynomial time.
  
  And as far as I've read , they are related to turing machine, so I thought may be the famous mystery question about them would be solved.