4 ms·

in other words anything can be Turing complete if provided infinite compute/storage

• mr_toad 3y ago
  Your typical “it’s just curve fitting” algorithm is not Turing complete, no matter how much memory and compute you throw at it.