Write a function to compute Fibonacci numbers (in the sequence 0, 1, 1, 2, 3, 5, ... where each number is the sum of the previous two numbers on the list). Use pattern matching but no if/then/else statements. Use a tail recursive solution to ensure the function doesn't take exponential time. Call your function Fibonacci. Test it by computing the 44th Fibonacci number. What happens when you try to calculate more significant Fibonacci numbers? Why? Indicate the answer in a comment in your code.

Kindly solve it in Python.