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 ...

We are grateful that the optics experts David A. B. Miller and Rodney S. Tucker have commented on our paper, and are happy that a fruitful conversation has resulted. Although it is of course true that ...