3 ms·

I suspect it's due to exponential complexity associated with input size. I am curious how you get to exponential complexity. The time complexity of a normal tr

I suspect it's due to exponential complexity associated with input size. I am curious how you get to exponential complexity. The time complexity of a normal transformer is quadratic. Or do you mean that the complexity of dealing with a codebase grows exponentially with the length?

ccvannorman 2y ago
Generally speaking, complexity grows exponentially with input size. A program of length 100 lines has the potential to be 1000x as complex as a program with length 10 lines. Consider the amount of information that could be stored in 4 bits vs 8 bits; 2^4 vs 2^8. As the potential to be complex grows, so does current AI's ability to effectively write and modify code at that scale.