Poincare's Conjecture

VirtualLarry

No Lifer
Aug 25, 2001
56,560
10,175
126
https://en.wikipedia.org/wiki/Poincaré_conjecture

I was just reading this, it was fairly interesting. What struck me, is the possibility that the flow of a computer program (turing machine), could be expressed as a complex topological pattern (flow graph of execution), and that the Poincare Conjecture could potentially be used to solve the Halting Problem.
 

Ken g6

Programming Moderator, Elite Member
Moderator
Dec 11, 1999
16,365
4,073
75
I doubt most computer programs could be expressed as a "simply connected" topological pattern.
Wikipedia said:
Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program-input pairs cannot exist.