Real talk here: is there a class of mathematical problem where trivial set sizes lead to provable (and sometimes intuitive) conclusions, but real world data sets become uncountably large, thereby being unsolvable? I want to say all this resembles NP-hard in that way (e.g. picking small teams for basketball is easy, huge is not), but we’re not doing any real math here.
At the same time, No True Scotsman is in play since how the fuck do you agree on a definition of “a wheel” or “a door?” Hell, technically speaking: both have axles and can rotate!
Real talk here: is there a class of mathematical problem where trivial set sizes lead to provable (and sometimes intuitive) conclusions, but real world data sets become uncountably large, thereby being unsolvable? I want to say all this resembles NP-hard in that way (e.g. picking small teams for basketball is easy, huge is not), but we’re not doing any real math here.
At the same time, No True Scotsman is in play since how the fuck do you agree on a definition of “a wheel” or “a door?” Hell, technically speaking: both have axles and can rotate!
Wheels are round. Planets are round. Therefore, all planets are wheels. And we do not have the parking space for that.