In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently ...

The DNA-based system is an experiment in how it may be possible to make a theoretical type of computer known as a non-deterministic universal Turing machine. Such a machine could solve tricky problems ...

University of Massachusetts Amherst computer scientist Hava Siegelmann has received funding to develop the first ever “Super-Turing” computer. Based on analog recurrent neural networks, Siegelmann ...