I think it is a mistake to think of these as finite problems[12] — they are infinite.
It is often possible to build multiple instances of a “big/small” dichotomy, such that the theory has similar results. (e.g. [small=”polynomial time”] vs [small=”decidable”]).
When I imagine using your concept to think about AI, I want to say that cloning a strawberry/proving the Riemann hypothesis is a finite task that nevertheless likely implies an endeavor of a different character than [insert something you could do manually in a few months].
I wonder if the [small=finite] version of your concept is the one we should be using.
It is often possible to build multiple instances of a “big/small” dichotomy, such that the theory has similar results. (e.g. [small=”polynomial time”] vs [small=”decidable”]).
When I imagine using your concept to think about AI, I want to say that cloning a strawberry/proving the Riemann hypothesis is a finite task that nevertheless likely implies an endeavor of a different character than [insert something you could do manually in a few months].
I wonder if the [small=finite] version of your concept is the one we should be using.