Gordian Knot

[Jonathan Post]

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?
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20061206/172f23ba/attachment-0001.htm>