3 ms·
> it's harder to show that the functions actually do the same thing Effectively impossible, with a Turing complete programming environment. (“Effectively,” be
by baddox 9y ago
> it's harder to show that the functions actually do the same thing
Effectively impossible, with a Turing complete programming environment.
(“Effectively,” because technically our physical computers have a bounded number of states and inputs, thus aren’t technically Turing complete, thus Rice’s theorem technically doesn’t apply.)
- TylerE 9y agoThere are however tools like QuickCheck (https://hackage.haskell.org/package/QuickCheck https://hackage.haskell.org/package/QuickCheck) that can bombard the function with large amounts of random (but legal) input data and makes sure it's behaving.