diff options
| author | alexdikelsky <alexander.dikelsky@gmail.com> | 2021-09-24 07:56:30 -0500 |
|---|---|---|
| committer | alexdikelsky <alexander.dikelsky@gmail.com> | 2021-09-24 07:56:30 -0500 |
| commit | ffd757232566f90d33b1903ca910da53f36bcd2a (patch) | |
| tree | 19cc8f5bc1a2d338129cba21e1ec1ef8b8f66d68 /doc/logic.md | |
| parent | 89ffbec6ac981a81b9e78e6555124f51fdd78df2 (diff) | |
Fix previous commit's grammer
Diffstat (limited to 'doc/logic.md')
| -rw-r--r-- | doc/logic.md | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/logic.md b/doc/logic.md index f9bdc896..360a651d 100644 --- a/doc/logic.md +++ b/doc/logic.md @@ -36,7 +36,7 @@ As with logical And and Or, any value and 0 is 0, while any value or 1 is 1. The ## Why not GCD and LCM? -The main reason for omitting these functions is that they are complicated and, when applied to real or complex numbers, require a significant number of design decisions where there is no obvious choice (for example, whether to use comparison tolerance). On the other hand, these functions are fairly easy to implement (reference implementations for [gcd](https://mlochbaum.github.io/bqncrate/?q=gcd) and [lcm](https://mlochbaum.github.io/bqncrate/?q=lcm) on [bqncrate](https://mlochbaum.github.io/bqncrate)), which allows the programmer to control the details, and also add functionality such as the extended GCD. +The main reason for omitting these functions is that they are complicated and, when applied to real or complex numbers, require a significant number of design decisions where there is no obvious choice (for example, whether to use comparison tolerance). On the other hand, these functions are fairly easy to implement (reference implementations for [gcd](https://mlochbaum.github.io/bqncrate/?q=gcd) and [lcm](https://mlochbaum.github.io/bqncrate/?q=lcm) are available on [bqncrate](https://mlochbaum.github.io/bqncrate)), which allows the programmer to control the details, and also add functionality such as the extended GCD. A secondary reason is that the GCD falls short as an extension of Or, because its identity value 0 is not total. `0∨x`, for a real number `x`, is actually equal to `|x` and not `x`: for example, `0∨¯2` is `2` in APL. This means the identity `0∨x ←→ x` isn't reliable in APL. |
