Read
Article

Network Game

Solve the most difficult computational problems

External Website
Game

Play the 'Netty'
prototype

Can humans out compete quantum computers?
Discover Cameron Calcluth's demo.

Read
External Article

Spin Glasses and Complexity

A book written by Daniel L. Stein & Charles M. Newman

Read
Article

The Science behind Network Game

We are explaining the gamification of the Sherrington-Kirkpatrick model.

Read
External Article

NP-hardness

The defining property of a class of problems that are, informally, "at least as hard as the hardest problems in NP"

Watch
Video

P vs. NP and the Computational Complexity Zoo

Explaining the difference between a P and NP problem

Read
External Article

Frustrated Spin Systems

Disorder-free systems that can be described by a periodic Hamiltonian

Beaumont Award

Our bachelor student Cameron Calcluth was given a Beaumont Award, which recognizes excellence in undergraduate research projects, for his work on the Netty game.

Network Game
Dismiss