We give new recursive constructions of complete caps in PG(n,2). We approach the problem of constructing caps with low dependency via the doubling construction and comparison to lower bounds. We report results of the exhaustive classification (up to projective equivalence) of all caps in PG(n,2) for n<=6.