Since 1966, the Turing Award has been given annually by the Association for Computing Machinery for technical or theoretical contributions to the computing community. It is widely considered to be the computing world's highest honour, equivalent to the Nobel Prize.

Initially, domain names were restricted to ASCII characters. This was a significant burden on people using other characters. Suppose, for example, that the domain name system had been invented by Greeks, and one could only use Greek characters in URLs.Most of the world’s population faced this situation until recently, because their languages use non-ASCII characters. A system was introduced in 2003 for internationalized domain names (IDN).This system is called Internationalizing Domain Names for Applications, or IDNA2003 for short. This mechanism supports IDNs by means of a client software transformation into a format known as ​ Punycode​ . A revision of IDNA was approved in 2010 (IDNA2008). This revision has a number of incompatibilities with IDNA2003.

URKUND is an automatic text-recognition system made for detecting, preventing and handling plagiarism, no matter language. We are passionate about helping schools, universities and corporations to encourage original writing and have done so for almost 20 years

​ Computer simulating 13-year-old boy becomes first to pass Turing test” Eugene Goostman is a chatbot that some regard as having beaten the Turing test, a test of a computer's ability to communicate indistinguishably from a human. 'Eugene Goostman' fools 33% of interrogators into thinking it is human, in what is seen as a milestone in artificial intelligence

Isaac Asimov's "Three Laws of Robotics"
1. A robot may not injure a human being or, through inaction, allow a human being to come to harm.
2. A robot must obey orders given it by human beings except where such orders would conflict with the First Law.
3. A robot must protect its own existence as long as such protection does not conflict with the First or Second Law.

Although quantum computers may be faster than classical computers for some problem types, those described above cannot solve any problem that classical computers cannot already solve. A Turing machine can simulate these quantum computers, so such a quantum computer could never solve an undecidable problem like the halting problem.
The existence of "standard" quantum computers does not disprove the Church–Turing thesis. It has been speculated that theories of quantum gravity, such as M-theory or loop quantum gravity, may allow even faster computers to be built. Currently, defining computation in such theories is an open problem due to the problem of time, i.e., there currently exists no obvious way to describe what it means for an observer to submit input to a computer and later receive output.

The definition of Nash equilibrium is then made up of two components:
1. Players are rational: Each player’s strategy maximizes his payoff, given his beliefs about the strategies used by the other players.
2. Beliefs are accurate: Each player’s beliefs about the strategies used by the other players are true.
Condition (1) is innocent enough; it’s condition (2) that is tougher to swallow.
The problems that cannot be solved in polynomial time are termed as intractable problems.

The term was coined by Tim Berners-Lee for a web of data (or data web) that can be processed by machines that is, one in which much of the meaning is machine-readable. While its critics have questioned its feasibility, proponents argue that applications in industry, biology and human sciences research have already proven the validity of the original concept.