To avoid stack overflow, I implemented a Fibonacci using a for loop.

non-recursive-fibonacci.py

#!/usr/bin/python

def fibonacci (t):
    if t <= 1:
        return t
    return (fibonacci(t - 1) + fibonacci(t - 2))

def fibonacci_set(t):
    if t == 0:
        return [0]
    if t == 1:
        return [0,1]

    start = [0, 1]
    index = 0
    for x in range(t - 1):
        start.append((start[x] + start[x+1]))

    return start

f = fibonacci_set(1000)
print (f)
print ("{:e}".format(f[-1]))