What counts for ‘tractability’, according to the standard definitions, is not the actual time taken to multiply a particular pair of numbers, but the fact that the time does not increase too sharply when we apply the same method to ever larger numbers.
Tractability—whether a calculation can be calculated—is a matter of the rate of growth of the time required to run increasingly complex calculations on the same algorithm.
