Search All of the Math Forum:
Views expressed in these public forums are not endorsed by
Drexel University or The Math Forum.
|
|
|
|
Should LOGIC PROGRAMMERS worry about SETS BIGGER THAN INFINITY?
Posted:
Dec 29, 2012 5:25 PM
|
|
ALL OF SCI.MATH A RESOUNDING - 'YES'
and 100 MEGABYTE of USELESS PROOFS TO GO WITH IT
and GET CALLED A KRANK IF YOU POST AN ALTERNATIVE!
L(x,y)
+---------------->
| 0. 2 3 4 5 6 7 ..
| 0. 9 8 7 6 5 5 ..
| 0. 1 2 3 1 2 3 ..
| 0. 9 8 9 8 9 8 ..
| 0. 6 5 6 5 6 5 ..
| 0. 5 6 5 6 5 6 ..
| ..
v
FLIP(d) = 6 IFF d<6
FLIP(d) = 5 OTHERWISE
Now apply your FLIP(d) function to the ENTIRE LIST
T(x,y)
+---------------->
| 0. 6 6 6 6 5 5 ..
| 0. 5 5 5 5 6 6 ..
| 0. 6 6 6 6 6 6 ..
| 0. 5 5 5 5 5 5 ..
| 0. 5 6 5 6 5 6 ..
| 0. 6 5 6 5 6 5 ..
| ..
v
T(x,y)
+---------------->
| 0. 6 X X X X X ..
| 0. X 5 X X X X ..
| 0. X X 6 X X X ..
| 0. X X X 5 X X ..
| 0. X X X X 5 X ..
| 0. X X X X X 5 ..
| ..
v
OK NOW YOU WANT TO ISOLATE
THAT PATH THROUGH T
AND ONLY THAT PATH THROUGH T!
***************************************
PERMUTING THE LIST
AND TAKING THE ANTI-DIAGONAL
IS *EQUIVALENT* TO
SELECTING A PATH THROUGH
THE TRANSPOSE LIST
***************************************
SAME THING!
YET THERE IS NO MISSING REAL
WHEN YOU DO IT MY WAY!
Herc
|
|
|
|
