3 ms·
> One thing fascinating by "analog computers" is the way they seem to be practically instantaneous regardless of n. That is perhaps part of the efficiency refle
by kybernetikos 9y ago
> One thing fascinating by "analog computers" is the way they seem to be practically instantaneous regardless of n. That is perhaps part of the efficiency reflected in the article.
If this were true, it would have profound implications. It's probably not true.
http://www.scottaaronson.com/papers/npcomplete.pdf http://www.scottaaronson.com/papers/npcomplete.pdf
- rhaps0dy 9y agoIt's "true". The catch is that the analog computer's circuit size (which is analog to the digital computer's time) has to scale with n.
- prestonbriggs 9y agoBut it's not true - the interesting components (the op amps, multipliers, etc) all have bandwidth limitations.
- VLM 9y agoHis soap bubble analogy is pretty cool. There is a direct analogy for filtering where its impossible to get instantaneous perfect response out of a filter, either DSP simulated or hardware. It would seem that merely filtering a signal is much simpler than simulating the airflow across a wing or whatever. There are also conceptual issues that the airflow across a wing is ideally under stable low angles of attack, constant, but during "fun times" which is precisely when you'd want a model instead of a test pilot, the air flow will vary over time (to the general detriment of flying ability...) so what it means to instantly solve a wing is unclear in itself.