Reaction systems represent a biologically inspired computational framework that abstracts the intricate interactions of biochemical reactions via two central mechanisms: facilitation and inhibition.

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

Henry Yuen is developing a new mathematical language to describe problems whose inputs and outputs aren’t ordinary numbers.

In the last few years, a few dedicated mathematicians have begun to study the computational complexity of video games. Their goal is to determine the inherent difficulty of the games and how they ...