[krastanov]

To your last point: I think I disagree, because your analog computer (like all analog computers) addresses one fixed-size instance of a problem, not the scalable family of problems. You can not make a computational complexity big-O statement about your analog computer, but you can do that about boson sampling and random circuit sampling. This is a crucial milestone in the creation of a physical realization of a computational device.

In your first paragraph, while I am sympathetic with your annoyance (pardon my imprecise choice of words), I disagree there too. Mostly because I can imagine the same argument used against Babbage, Lovelace, and Turing, who did their theory (and failed experiment) work decades to a century before a scalable classical computer existed.