Some time ago there was a thread disucssing numeric ordering issues; the
fact that ℂ lacks an ordering was part of that discussion.
A recent paper on arxiv proposes inflicting an ordering on ℂ using:
,< excerpt from http://arxiv.org/abs/1003.4906 >
|
| Given A = a₁ + i·a₂ and B = b₁ + i·b₂, t
On Mar 28, 2010, at 3:09 PM, James Cloos wrote:
| Given A = a₁ + i·a₂ and B = b₁ + i·b₂, then:
|
| A ≤ B if a₁ < b₁ || ( a₁ == b₁ && a₂ ≤ b₂ )
| A ≥ B if a₁ < b₁ || ( a₁ == b₁ && a₂ ≥ b₂ )
Assuming that the last line should be "A ≥ B if a₁ > b₁ ...",
this is called lexicographic ordering, a
Author: lue
Date: 2010-03-29 01:07:56 +0200 (Mon, 29 Mar 2010)
New Revision: 30231
Modified:
docs/Perl6/Spec/S03-operators.pod
Log:
[docs/Perl6/Spec] Fixed a P5 muscle-memory error
Modified: docs/Perl6/Spec/S03-operators.pod
===
-
I was actually thinking, during the previous thread involving Complex numbers
...
It may not have any practical use, but if one wanted to define an ordering for
complex numbers that was deterministic and relatively unbiased, a way to do this
would be based on what I'll call for now the "spiral
Author: vamped
Date: 2010-03-29 06:30:14 +0200 (Mon, 29 Mar 2010)
New Revision: 30235
Modified:
docs/Perl6/Spec/S32-setting-library/Str.pod
Log:
Perl 5 thinko - changed to bash for first regex match
Modified: docs/Perl6/Spec/S32-setting-library/Str.pod
