Why any exponential algorithm can in fact be executed in linear time | comput. complexity | advanced

Episode 94.

Why any exponential algorithm can in fact be executed in linear time | comput. complexity | advanced.
Why any exponential algorithm can in fact be executed in linear time | computational complexity | advanced level.

Branch of mathematics: computational complexity.
Difficulty level: advanced.

Why any exponential algorithm can in fact be executed in linear time. An exponential algorithm is defined as an algorithm that requires exponential number of steps. And for the time, we consider the actual time, not just the number of steps. At the scale of years and larger, we need to account for the progress of computing technology, which is exponential: the number of steps executed per second grows exponentially. When we account for that, an algorithm that is exponential in terms of the number of steps becomes linear in terms of time.

This is my original idea. I don't know if anybody thought about it before. Probably, somebody did. But I came up with this idea by myself.

Mathematics. Computational complexity.
#Mathematics ComputationalComplexity

The same video on YouTube:
https://youtu.be/-I0h_E_9iKE

The same video on Telegram:
https://t.me/mathematical_bunker/117