If it was a real superhuman AI it would use the closed form expansion

https://en.wikipedia.org/wiki/Fibonacci_sequence

Writing Fibonacci in assembly as recursive functions using C-like calling conventions is like asking Superman to mainline Kryptonite, rather I'd expect an assembly implementation to look like a BASIC version that calculates iteratively.