We review the complexity of Fibonacci’s sequence \(1, 1, 2, 3, 5, 8, 13,\) etc., and its relation to S. Wolfram’s informal definition of computational irreducibility. We consider whether topological irreducibility has analogy to computation, and this is somewhat speculative, as we are looking for strategies to prove that \(O(log_2~N)\) is the minimal complexity of computing the \(N\)th Fibonacci element \(f(N)\).