|
|
|
|
|
by Xcelerate
615 days ago
|
|
Number theory appears to be at the core of computability, via Matiyasevich's theorem, which links the behavior of every Turing machine to the solutions (or lack thereof) of Diophantine equations. It’s not surprising to me that number theory constantly ends up being more useful than suspected since in many ways the study of these equations is equivalent to the study of computation. |
|