Gordian Knot

[Jon Awbrey]

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o

i do knot no, but i think it's obvious that many seqfanaddicts
are definitely at loose ends on e-count of the oeis being idle.

ja

Jonathan Post wrote:
> 
> Is there such a thing as an Uncomputable Knot?  An object for which determining if it a knot or
> link or unknot requires an uncomputable function? Perhaps as a limit of a sequence of knots with
> integer invariants (which could be an OEIS sequence)? Perhaps from a Hilbert's 10th Problem issue
> on a knot polynomial, or from the word problem in Groups, or the Homeomorphy problem?
> 
> Only an Oracle can tell if the Gordian Knot is uncomputable, or untie an Uncomputable Knot?

o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o
inquiry e-lab: http://stderr.org/pipermail/inquiry/
wikinfo: http://wikinfo.org/wiki.php?title=User:Jon_Awbrey
meta: http://www.getwiki.net/wiki.php?title=User:Jon_Awbrey
wp review: http://wikipediareview.com/index.php?showuser=398
o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o~~~~~~~~~o