Is a Knot Classification possible?

Abstract

The goal of this paper is to discuss the possibility of finding an algorithm that can give all distinct knots up to a desired complexity. Two such algorithms are presented, one based on projections on a plane, the other on closed self-avoiding walks.

arXiv comment32 pages and 28 figures (figures available upon request), plain TEX