3 ms·
> A complete general implementation requires some kind of static notion of an "inverse", which is hard in turing complete languages. I don't think it's Turing
by JadeNB 11y ago
> A complete general implementation requires some kind of static notion of an "inverse", which is hard in turing complete languages.
I don't think it's Turing completeness that's the issue (though it is an issue, of course) so much as non-invertibility. (I've always been fascinated by https://en.wikipedia.org/wiki/Reversible_computing https://en.wikipedia.org/wiki/Reversible_computing , but it doesn't seem, at least to my limited perspective, like it's the subject of much current research.) For example, what should the inverse of `(^2) :: Complex -> Complex` be?