  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.
