Blum proved that any mathematical theorem can be converted into a graph such that the proof of that theorem is equivalent to proving a Hamiltonian cycle in the graph
from Applied Cryptography by Bruce Schneier
I'm struggling to understand what the statement means, and I was unable to find anything on it after a few quick google searches. Can someone point me in the right direction, to what this statement is even talking about?