-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
SOURCE AND PERFECT CERTAINTY
CB Willis (cbwillis@adore.lightlink.com) wrote:
>Homer Wilson Smith (homer@lightlink.com) wrote:
>> Perception of certainty in fact is direct perception of *PERFECTION*,
>>and that leads right into the mind of God.
>Are you saying now there are other minds, i.e. the mind of God, or are you
>saying you are God? It sounds like you're saying the first and that your
>experience leads you from point A to point B [the mind of God].
I am mixing modes of thought and engaging in real bad metaphors
put through the blenders.
If God is defined as the All That Is, my present model is that
God consists of
1.) Source which is the mechanical causal ground of things that
are, which includes the holographic projection mechanism and the
respository for data and universes etc. It is not conscious, it is
the causal ground of conscious units, and connects them together if
there is more than one.
2.) Conscious units, which are the view port between Source and
manifestation. They are the lens through which internal unmanifest
data and universes are projected out onto the view screen of their
conscious color form to become manifest data and universes through the
process of 'casting'. "Source sources, only when Will casts."
3.) The view screen of our conscious color form itself, upon
which data and universes are manifested and viewed by the conscious
unit view port.
What is displayed on the viewport screen is a virtual reality of
implied external matter, energy, space and time. It is a dream of
such, no more, no less. Source sources, what source is not.
Attempts to learn about the virtual reality are destined to use
dream machines to measure dream events. They give rise only to
theories which can never be certain because one can only experience
the dream, not what the dream represents in the way of external
universe. There is no proof the external universe is actually there,
and in fact it isn't.
Thus the quest for perfect certainty in the study of the virtual
reality is impossible. However one CAN find perfect certainties if one
studies the viewport and its ability to see itself and its manifesting
color forms. Thus perfect certainty is a fundamental OPERATING PART of
the make up of the Source - Conscious Unit - Color Form triad. because
it is impossible to be conscious-of with out being certain-of whether
one notices this with certainty or not. Thus by studying the nature of
perfect certainty, one is studying the mechanism by which the All That
Is manifests and knows it manifests.
Homer
>- CBW
- --
- ------------------------------------------------------------------------
Homer Wilson Smith Clear Air, Clear Water, Art Matrix - Lightlink
(607) 277-0959 A Green Earth and Peace. Internet Access, Ithaca NY
homer@lightlink.com Is that too much to ask? http://www.lightlink.com
================ http://www.clearing.org ====================
Thu Sep 7 12:00:02 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/proof9.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZsW0DURT1lqxE3HERAjbiAJ4nN6hgn98c6RxgKgAWg3QsUE0hawCfVGp7
lftc7HZV3rF+qygfBKdOaJA=
=6NdZ
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
Friday, September 8, 2017
ADORE162 (fwd)
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Richard Platek \(Lion\) (lion@lightlink.com) wrote:
>Homer asked, a while ago.
>> As I have said DEFINE GOODNESS.
>Homie,
>This is not a question. It's a HUGE process.
>You go first, and share results :)
Goodness starts at the personal level with pleasure and avoidance
of pain.
It extends to sensitivity to others to maximize the pleasure and
minimize the pain in the world.
Relative to others, goodness takes pleasure at other's pleasure,
and evil take pleasure at others pain etc.
Above that we have art, story telling, practical jokes, the
master of jest etc.
Here pain is created as dischord to enhance the ultimate resolve.
One can have pleasure without pain, but one can not have RESOLVE
without pain. Resolve is a special kind of pleasure most akin to
humor.
However a practial joke played on oneself is one thing, and
practical joke played on another without their permission is quite
another.
Thus incidents do not resolve, do not find the humor, until the
being finds the permission point where he either gave permission, paid
for the privilege of being duped or found out that he did it himself
as an act of self love.
Take a simple example of a mean practical joke.
I come up to you one day and I convince you beyond a shadow of a
doubt that your wife and kids are dead.
Later, a LONG time later, you find out quite by accident that it
was never true.
OK so now you feel better about them still being alive, but you
still feel rotten about having believed them dead, you don't
appreciate the joke that was played on you.
Getting to the HUMOR of the incident is necessary to resolve it
so that IT WAS WORTHWHILE, rather than a waste of time.
One can learn lessons from nasty jokes, mostly to make sure they
never happen again, but this does not make the joke worthwhile,
appreciation for the joke is still lacking. Only finding the humor
and willingness to have had it happen in the first place, makes the
joke worthwhile. One can even become willing to NOT learn the lessons
(which sink one anyhow with persisting wisdom) because one becomes
willing to have it happen again.
This is true resolution.
So there is the impulse to goodness (Class), and the impulse to
practical jokes (Majesty). The first is what human's call goodness.
The second is the goodness of God.
The Jokes are only worthwhile because God plays them on himself
with full permission.
For God to create a physical universe and then create a small
animal creature against its will, that has to kill to surive, and
place that creature in the physical universe to survive or die, only
to die in the end anyhow, would be an act of exceptional evil cruelty.
THERE IS NO LESSON THAT COULD BE LEARNED, NO ULTIMATE STATE
ATTAINABLE THAT COULD MAKE UP FOR AND RESOLVE THE ORIGINAL RAPE of the
being by God for having been created as such a thing.
It only becomes a Masterful Practical Joke because God did it to
himself. This can resolve.
But as a human, no human would do this to themselves.
So the God aspect is a dicom to the Human aspect of a being.
The God aspect creates himself as a human that would never do
such a thing to himself, so the human seeks to be come God to protect
himself from all the hurt he finds himself in. This of course is a
trap of non resolution. For the God he seeks to become would never
recreate himself back as a human again.
The human thinks of God as a super human, not as an Imp Soul.
The human wants a FATHER as a God, and to become such himself, a
protector of all who have been done wrong.
But the real God is not a super human, but a pre human.
Not a protector of humans at all, but a purveyor of disaster and
danger, of both sides of every dicom there is.
Thus one can only become that God by finding the motive and
beauty and humor to becoming human in a game you can't win, in the
first place.
By human of course I don't mean 'in a body' although that is
included, I mean that which is creature, that which is fragile,
physically, emotionally, mentally or spiritually.
Fragile means able to be hurt, caused to suffer, or damaged,
whether these be illusions or not.
The unfragile creator creates itself as fragile creature, and the
fragile creature comprehends it not, until it gets the joke, and it
self becomes the creator of itself as fragility incarnate again.
THEN the being is the unfragile God again.
The only way to BE God is to BE God creating itself as the
Creature.
Homer
================ http://www.clearing.org ====================
Wed Sep 6 12:00:02 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/adore162.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZsBuDURT1lqxE3HERAj8UAJ0dKBeBICcYeIUzl2IC22IxkW9BnACgpvoR
HqtZQtvquS3Vxuq7887kVWo=
=2aoX
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
Hash: SHA1
Richard Platek \(Lion\) (lion@lightlink.com) wrote:
>Homer asked, a while ago.
>> As I have said DEFINE GOODNESS.
>Homie,
>This is not a question. It's a HUGE process.
>You go first, and share results :)
Goodness starts at the personal level with pleasure and avoidance
of pain.
It extends to sensitivity to others to maximize the pleasure and
minimize the pain in the world.
Relative to others, goodness takes pleasure at other's pleasure,
and evil take pleasure at others pain etc.
Above that we have art, story telling, practical jokes, the
master of jest etc.
Here pain is created as dischord to enhance the ultimate resolve.
One can have pleasure without pain, but one can not have RESOLVE
without pain. Resolve is a special kind of pleasure most akin to
humor.
However a practial joke played on oneself is one thing, and
practical joke played on another without their permission is quite
another.
Thus incidents do not resolve, do not find the humor, until the
being finds the permission point where he either gave permission, paid
for the privilege of being duped or found out that he did it himself
as an act of self love.
Take a simple example of a mean practical joke.
I come up to you one day and I convince you beyond a shadow of a
doubt that your wife and kids are dead.
Later, a LONG time later, you find out quite by accident that it
was never true.
OK so now you feel better about them still being alive, but you
still feel rotten about having believed them dead, you don't
appreciate the joke that was played on you.
Getting to the HUMOR of the incident is necessary to resolve it
so that IT WAS WORTHWHILE, rather than a waste of time.
One can learn lessons from nasty jokes, mostly to make sure they
never happen again, but this does not make the joke worthwhile,
appreciation for the joke is still lacking. Only finding the humor
and willingness to have had it happen in the first place, makes the
joke worthwhile. One can even become willing to NOT learn the lessons
(which sink one anyhow with persisting wisdom) because one becomes
willing to have it happen again.
This is true resolution.
So there is the impulse to goodness (Class), and the impulse to
practical jokes (Majesty). The first is what human's call goodness.
The second is the goodness of God.
The Jokes are only worthwhile because God plays them on himself
with full permission.
For God to create a physical universe and then create a small
animal creature against its will, that has to kill to surive, and
place that creature in the physical universe to survive or die, only
to die in the end anyhow, would be an act of exceptional evil cruelty.
THERE IS NO LESSON THAT COULD BE LEARNED, NO ULTIMATE STATE
ATTAINABLE THAT COULD MAKE UP FOR AND RESOLVE THE ORIGINAL RAPE of the
being by God for having been created as such a thing.
It only becomes a Masterful Practical Joke because God did it to
himself. This can resolve.
But as a human, no human would do this to themselves.
So the God aspect is a dicom to the Human aspect of a being.
The God aspect creates himself as a human that would never do
such a thing to himself, so the human seeks to be come God to protect
himself from all the hurt he finds himself in. This of course is a
trap of non resolution. For the God he seeks to become would never
recreate himself back as a human again.
The human thinks of God as a super human, not as an Imp Soul.
The human wants a FATHER as a God, and to become such himself, a
protector of all who have been done wrong.
But the real God is not a super human, but a pre human.
Not a protector of humans at all, but a purveyor of disaster and
danger, of both sides of every dicom there is.
Thus one can only become that God by finding the motive and
beauty and humor to becoming human in a game you can't win, in the
first place.
By human of course I don't mean 'in a body' although that is
included, I mean that which is creature, that which is fragile,
physically, emotionally, mentally or spiritually.
Fragile means able to be hurt, caused to suffer, or damaged,
whether these be illusions or not.
The unfragile creator creates itself as fragile creature, and the
fragile creature comprehends it not, until it gets the joke, and it
self becomes the creator of itself as fragility incarnate again.
THEN the being is the unfragile God again.
The only way to BE God is to BE God creating itself as the
Creature.
Homer
================ http://www.clearing.org ====================
Wed Sep 6 12:00:02 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/adore162.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZsBuDURT1lqxE3HERAj8UAJ0dKBeBICcYeIUzl2IC22IxkW9BnACgpvoR
HqtZQtvquS3Vxuq7887kVWo=
=2aoX
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
Tuesday, September 5, 2017
LZW (fwd)
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
LZW COMPRESSION AND DECOMPRESSION
Copyright (C) 1993 Homer Wilson Smith
Redistribution rights granted for non commercial purposes.
The LZW compression algorithm is probably one of the most mind
boggling algorithms to come along, but it is also one of the most
brilliant, so it is worth understanding well.
It's really quite mind opening.
Ever program something you didn't fully understand, but because it
worked fine you let it go, and then months later found yourself still
wondering why your code worked?
Well that's what happened to me with LZW compression.
My programs worked, for a very long time they worked, until one day
I went to send a large tiff to a color separator, and bang nothing would
read it.
Corel Draw wouldn't read it, CSHOW wouldn't read it, my own damn
tiff program wouldn't read it, and that REALLY pissed me off.
I had written my tiff programs with barely passable understanding
of the algorithm, following along the pseudo code provided by others,
with little personal comprehension myself. I had read a number of
descriptions trying to make LZW compression and decompression clear to
me, but basically all I ended up with was a partial understanding of the
encoding process and no understanding at all of the decoding process. I
kind of programmed it blind, and hoped it would work.
It took me many hours to find the bug, it was one of those 'it
crops up every hundred million years' kind of bug, and I didn't know
what I was doing anyhow, so it wasn't easy.
But from all bad things comes something good (I think) and this
paper is the result. I finally understood both sides of the compression
and decompression dichotomy, and I am reasonably sure my programs will
work because I understand them and not because I followed someone else's
code.
The proof of course is in the pudding, and the pudding is whether
or not I can explain this to others so that they get it the first time.
The algorithm is really quite brilliant, and worth knowing just for the
fun of it.
This paper is not meant to replace everything else you might read
on the subject of LZW encoding or TIFF and GIF files, but it is intended
to make all that other stuff clear. This is what I wish someone had
written for me when I first approached the subject.
WHY DATA COMPRESSION
The problem with data is it takes up so much damn space, and with
the cost of hard disk space and the slowness of telecommunications, it
behooves us to find a way to make data smaller, to make it take up less
room, so that we can then use up the space we free up to fill it with
more data!
It actually takes less time to compress data than it does to
transmit it, so its a good cost saving to compress the data first, then
transmit it and uncompress it at the other end.
RUN LENGTH ENCODING
Various encoding schemes have been devised to take care of this
need, one of the earliest most obvious ones being RUN LENGTH ENCODING.
Run length encoding takes advantage of the fact that often many pixels
right next to each other are the same pixel, so rather than sending them
all one by one they are counted up into a RUN and two bytes are sent
instead, the first byte telling how many pixels there were of one
number, and the next byte the number it was.
Thus a run of pixels that looked like this
5 5 5 3 3 3 9 9 9 9 9 1 1 1 1
would be run length encoded as
3 5 3 3 5 9 4 1
an obvious saving of space. The longer the runs are the more space is
saved as each color run is represented by only two bytes, a count and a
color. If your counts can go only up to 255, then if the run is longer
you have to start a new run, but if your counts can go up to 32767, then
you can handle longer runs before you have to start a new run.
The problem comes in when the data does not consist of large
expanses of identical pixels, who wants to look at a single patch of red
anyhow. A worst case scenario of course is when every pixel is
different such as,
2 3 4 5 6 7 8 9 etc.
Encoding this as RLE would produce,
1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9
which is an obvious waste of space.
One solution to this is to insert an INTRODUCER byte before each
sequence telling whether it is a horizontal run, or a stretch of one
byte per pixel. Thus runs may start with positive counts, and stretches
of one byte per pixel may start with a negative count.
Thus the sequence
3 3 3 3 3 1 2 3 4 5 6
would be compressed as
5 3 -6 1 2 3 4 5 6
giving some compression, but its obviously not an ideal solution.
There is also tremendous complexity involved in programming the
ideal compression for data that has a lot of 2 byte runs in it.
For example,
3 3 4 5 3 3 4 5 3 3 4 5
is better put out as a single stretch of one byte per pixel
-12 3 3 4 5 3 3 4 5 3 3 4 5
rather than as a mixture
2 3 -2 4 5 2 3 -2 4 5 2 3 -2 4 5
because of the the one byte overhead in switching from horizontal runs
to one byte per pixel.
One might make a simple rule that all two byte runs should be put
out as one byte per pixel, except that this is only true if you have
already opened a one byte per pixel stretch, otherwise 2 byte runs
should be put out as a horizontal run (count,byte).
In any case run length encoding (RLE) only produces good compressio
when the data is even and unchanging. Fractals of course are the
antithesis of unchanging data, so RLE does not work well on fractals or
any other natural data like video frames or even written work.
In other words if you have a patch of red to compress use RLE.
Otherwise keep reading.
The LZW Algorithm
There are four concepts that need to be understood. They are,
1.) INPUT CODE
2.) TABLE INDEX
3.) TABLE CODE
4.) OUTPUT CODE
The purpose of LZW compression is to turn the input code stream
into an output code stream of lesser length, and then later to
reconstruct the input code stream from the output code stream. This
accomplishes the purpose of compression and decompression.
The above four concepts can be visualized as follows:
INPUT CODE TABLE OUTPUT CODE
STREAM INDEX CODE STREAM
- ------------------------------------------------------------------------
CODE, CODE, CODE... (INDEX, CODE) CODE, CODE....
(INDEX, CODE)
(INDEX, CODE)
.
.
CODE. A code is a byte wide entity consisting of 8 bits and
ranging in decimal value from 0 to 255. They can be considered as
characters, or as integer numbers, it doesn't matter. They are NOT
signed integers however. INPUT CODES, TABLE CODES and OUTPUT CODES are
all of this format.
INDEX. An index is a two byte wide SIGNED entity consisting of 16
bits and ranging in decimal value from -32768 to 32767. It is called an
index because it refers to an earlier entry in the table. For example,
if table entry number 400 consists of the (index,code) pair (312,5),
then 312 is called a table index and points BACKWARDS to table entry
312, and 5 is a table code generated in the process of compression.
Table entry 312 will itself have an (index,code) pair that will point to
an even earlier table entry, which will point to an earlier table entry
ad infinitum until you come back to the first table entries before which
there are none. These first entries in the table are called the ROOT
AREA.
If a table entry has -1 for an INDEX, that means that that table
entry does NOT refer to any earlier table entry. -1's appear as table
indexes either
1.> when a table entry is still unused or
2.) when it resides in the ROOT AREA as described below.
Table entries in the root area do not point to earlier table
entries because there are no earlier entries.
Table entries that haven't been used yet don't point to earlier
table entries because they haven't been used yet!
In either case the table index will be -1.
0 by the way is a valid table index which points to the very first
table entry in the root area, table entry number 0.
INPUT CODE STREAM. The input code stream is the sequence of bytes
that you wish to compress into a hopefully shorter output code stream.
OUTPUT CODE STREAM. The output code stream is the sequence of
bytes that is the final product of compression, and is hopefully shorter
than the input code stream and RECONSTRUCTIBLE BACK into the input code
stream. It's no good compressing something if you can't uncompress it!
TABLE. The table is a two column table of integer numbers of the
following form:
TABLE
POSITION (INDEX,CODE)
- ------------------------------------------------------------------------
----- 0 (-1 , 000)
| 1 (-1 , 001)
| 2 (-1 , 002)
| . .
ROOT AREA . .
| 255 (-1 , 254)
| 255 (-1 , 255)
| 256 (-1 , 256) Clear Code (CC)
----- 257 (-1 , 257) End of Information Code (EOI)
----- 258 (INDEX,CODE)
| 259 (INDEX,CODE)
ADDED .
ENTRY AREA .
| 278 (INDEX,CODE)
| 279 (INDEX,CODE) <---TABLE POINTER to latest entry
| 270 (-1 , 0) As yet unused entries
| 271 (-1 , 0) "
| . .
----- 4095 (-1 , 0) End of table.
The table consists of only the two columns of numbers, the table
position numbers are NOT in the table and are only shown for clarity.
The table consists of 2 areas, the ROOT area and the ADDED ENTRY
AREA.
ROOT AREA. The root area consists of the first 258 entries in the
table numbered from 0 to 257. The entries from 0 to 255 are initialized
at program start up to the numbers shown and do not change during the
duration of the program. Entries number 256 and 257 are also set during
program start up and are used to control the process of compression and
decompression. Their CODE values are otherwise arbitrarily chosen.
Because their values are greater than 255, table codes must use 16
bit wide integers, even though codes have only 8 significant bits.
The table indexes in the root area are set to -1's because they do
not point to any earlier table entry. The table codes in the root area
are set to the basic alphabet of possible characters in the input code
stream, in this case the integers from 0 to 255. The Codes for
CLEARCODE and END OF INFORMATION CODE are arbitrarily set to 256 and
257.
This leaves table position 258 as the first empty position to ADD
new entries into the table when the compression process actually starts.
ADDED ENTRY AREA. At program start up positions 0 through 257 are
initialized as described above and a pointer is set to the last entered
entry in the table, in this case 257. The remaining table entries are
initialized to (-1,0) as shown and usually there are a total of 4096
entries in the table numbered 0 to 4095, including the root area.
During the process of compression the program scans the input code
stream and adds new entries to the table according to the LZW
compression algorithm which we will discuss at length below. Each new
table entry consists of an (INDEX,CODE) pair which is determined by the
input code stream and the LZW algorithm. As each new (INDEX,CODE) pair
is found the table pointer is incremented by by one and the new
(INDEX,CODE) pair is inserted into the table at the position pointed to
by the table pointer.
In the following discussion we wish to prove the following points.
1.) The table is constructed from and totally determined by the
input code stream. The table is usually shorter than the input code
stream and so compression has taken place in the construction of the
table. This is because each table entry can represent more than one
character in the input code stream.
2.) From the table alone the input code stream can be
reconstructed. Thus if you have the complete table you can reconstruct
the input code stream.
3.) The right hand column of table codes can be reconstructed from
the left hand column of table indexes alone. Thus if you know the left
hand table indexes you can recompute from that information alone the
right hand table codes and thus the input code stream.
4.) Thus the table indexes can act as the final output compressed
data stream, or in other words, the output codes ARE the table indexes
from the added entry area.
Do not get table codes confused with the output codes. The table
INDEXES become the output codes.
Because the table indexes can go up to 4095, they need 12 bits to
represent them. Although they are computed as 16 bit wide integers,
when they are finally output to the output data stream, they are packed
at 12 bits each.
Thus an input data stream of 8 bit integers gets compressed and
output as an output data stream of 12 bit integers.
Since each table index can represent a unique string of varying
length, overall compression takes place.
For example if a single 12 bit wide table index represents the 3
character string of 'ABC' or 24 bits, that is a compression factor of
2:1. Three characters at 8 bits each are compressed into one character
of 12 bits.
5.) The process of uncompressing the output code stream then works
as follows.
First you must rebuild the table indexes from the output code
stream. The ROOT AREA of the table is trivial as it is always the same.
The ADDED ENTRY AREA is almost as trivial. The table index column
of the added entry area IS the sequence of output codes, as the output
codes ARE the table indexes. The table code column of the added entry
area is then recomputed from the table index column by means that will
become obvious when the full algorithm is discussed, and that completes
the rebuilding of the table from the output codes. From the completed
table one can then reconstruct the original input code stream.
So how does LZW work?
The idea behind LZW is that not only do some pixels repeat
themselves, but many SEQUENCES of pixels repeat themselves.
For example take the input code stream (in bytes),
ABCDEABCDEABCDEABCDEABCDE
Such a sequence would not lend itself well to run length encoding
because no single pixel forms a run. However the sequence of 5 pixels
ABCDE certainly form a run as they appear one right after the other 5
times.
One might even suggest a super run length encoding that could seek
out repeating runs of SEQUENCES and perhaps encode a string like
ABCDEABCDEABCDEABCDEFGHFGHFGHFGHFGH
stream as something like,
5(ABCDE) 4(FGH)
However LZW goes one step further and recognizes that the string
ABCDE can appear anywhere in the input code stream, not just in
consecutive runs, so why not just assign the string ABCDE a unique
number, say 234, and then every time that string appears replace it with
the single byte 234.
So if 234 is assigned to ABCDE and 235 is assigned to FGH then the
above 20 byte string could be compressed into the 9 bytes
234 234 234 234 234 235 235 235 235
Of course the number 236 could be assigned to the string ABCDEABCDE
and 237 assigned to FGHFGHFGH, so now the same 20 byte input code stream
could be output as
236 236 234 237 235
Obviously you stand to create a lot of compression this way.
Just as obviously the whole scheme is utterly preposterous, as you
could just assign one number, say 234, to the whole damn text and then
output only that one number!
The problem is clearly keeping track of what string each number
stands for. That is where a string table comes in.
STRING TABLES
A string table is merely a table of strings of varying length and
the code numbers that have been assigned to them. In this case the
string is inserted into the table at the table entry position
corresponding to the code number assigned to that string so that the
code numbers do not also have to stored.
For example let's say we have collected the following table of
strings.
TABLE TABLE
POSITION STRING ENTRY
- ------------------------------------------------------------------------
232 SDF
233 JHIKLNN
234 ABCDE
235 FGH
236 ABCDEABCDE
237 FGHFGHFGH
With such a table in hand it would be easy enough to covert the
output code stream,
236 236 234 237 235
back into the original input stream of
ABCDEABCDE ABCDEABCDE ABCDE FGHFGHFGH FGH
(Without the spaces of course.)
Which is what we want.
The problem of course with this method is that you have to have the
table in order to know what the code numbers stand for, and the space
you save by compressing your input code stream into the smaller sequence
of bytes is mostly lost in having to carry the whole table along with
you.
This becomes obvious in the extreme example of assigning the whole
text one number and putting the whole text in the table as one entry.
You are actually up a byte from the original data, namely the damn code
number. Not a good compression ratio.
The key question is, can the table be reconstructed FROM the output
code stream? If not then you have to carry the table with you to decode
the output code stream, and that wastes space.
If you CAN reconstruct the table from the output code stream then
you can throw the tables away as you produce the output, and recover
them later when you want to go in the other direction.
LZW takes this one step further in that the output code stream IS
the table, at least the left hand column of table indexes, and the right
hand column of table codes can be easily computed from the table
indexes. Once you have both you can recompute the input code stream.
So how does it work?
THE LZW ALGORITHM
The algorithm depends on the idea that any given input string
either is or is not in the table. If it is in the table it is not put
in again. If the string is not in the tale it is immediately put in.
But let's look at how the algorithm gets its strings.
Assume we want to compress the input code stream
ABABABAB
Remember the characters A and B are bytes to the computer and so
are really integer numbers somewhere between 0 and 255. In this case A
is 61 and B is 62.
The algorithm starts with the first character in the input code
stream and continues to grab characters from the input stream building a
string until it builds a string that is NOT in the table.
The string table is first initialized with all possible single
character strings, this forms the root area of the table. Let's
simplify this and just assume for the moment that there are only 4
different single character strings rather than 255, and let's call them
A, B, C, D. Let's also forget the clear code and the end of information
code, so that our root area has just 4 entries in it, numbered 0 through
3. and the first added entry will go in position 4.
Then the table will look like this after initialization.
CODE STRING
0 A
1 B
2 C
3 D
Since ALL possible single character strings ARE in the table in the
root area the very first character that is taken from the input code
stream will definitely be in the table. In this case that is the letter
A.
So nothing is added to the table and the next character is grabbed.
This creates the string AB. AB is NOT in the table so we add it to the
table at position 4.
0 A
1 B
2 C
3 D
4 AB
We now do something very strange, something that will probably earn
LZ&W their Nobel Prize in mathematics: we discard everything in the
string but the last letter of the string and start anew.
So now we have string B which is definitely in the table in the
root area, so we go on and grab the next character in the output code
stream which is another A. The string BA is NOT in the table so we add
it to position 5.
0 A
1 B
2 C
3 D
4 AB
5 BA
We discard all but the last letter of the string leaving us with A
again which is in the table in the root area. We grab the next
character in the input code stream forming AB. Now this time AB is
already in the table from the last time we came across it, so we
continue on to the next character. This gives us ABA. ABA is NOT in
the table so we enter it in position 6.
0 A
1 B
2 C
3 D
4 AB
5 BA
6 ABA
Keeping the last letter A, we grab the next character in the input
code stream forming AB. This is in the table, so we get the next
character forming ABA which is ALSO now in the table. Adding the next
character we get ABAB which is NOT in the table so we add it at position
7.
0 A
1 B
2 C
3 D
4 AB
5 BA
6 ABA
7 ABAB
At this point you can clearly see how to build the rest of the
table from the input code stream. You do this until you run out of
input code stream or table room at which point you clear the table and
start over again with a new table.
Let's assume we ran out of input codes, so as usual we discard all
but the last character of the last string and that leaves B. Since
there are no further codes to add to B, it becomes the last string.
0 A
1 B
2 C
3 D
4 AB
5 BA
6 ABA
7 ABAB
8 B
And there we have our completed table.
Now here is where the brilliance comes in. Each string is added to
the table because it was not already in the table. But each string is
built up one character at a time so each one of its predecessor strings
HAD TO BE IN THE TABLE for that string to get as long as it did before
it got put in the table.
In other words its that LAST CHARACTER at the end of each string in
the table that made that string NOT BE in the table. This means that if
you take any string in the table and remove its last character you must
have a string that was already in the table earlier.
Thus each string can be split up into its last character and an
index into an earlier entry in the table. And voila you have the
(INDEX,CODE) form of the string table.
TABLE TABLE IN TABLE IN
POSITION STRING FORMAT INDEX,CODE FORMAT
0 A -1 A
1 B -1 B ROOT AREA
2 C -1 C
3 D -1 D
4 AB 0 B |
5 BA 1 A ADDED ENTRY
6 ABA 4 A |
7 ABAB 6 B
8 B 1 x x means doesn't matter.
So the first thing we need to demonstrate is that the input code
stream can be reconstructed from the table, particularly from the table
indexes in the added entry area, 0 1 4 6 1.
The first thing we must realize is that each table index refers to
an earlier complete string already in the table.
For example in position 7 there is a (6,B). The 6 refers to
position 6 where there is a (4,A). The 4 refers to position 4 where
there is a (0,B) and the 0 refers to position 0 where there is a (-1,A)
The -1 means you are in the root area and the backwards search ends.
So the (6,B) in position 7 means that position 7 contains a string
which is a B preceded by the string in position 6. But the string in
position 6 is an A preceded by the string in position 4. The string in
position 4 is a B preceded by the string in position 0. And the string
in position 0 is an A preceded by nothing.
So what string does table index 6 refer to? This is the way you
figure it out.
The | means refers to. This says that index 6 (6,B) pos 7
refers to an A preceded by what's in position 4, |
what's in position 4 is a B preceded by what's in (4,A) pos 6
position 0, and what's in position 0 is an A |
preceded by nothing 'cuz its root. This gives (0,B) pos 4
us the string ABA for index 6. Looking in the |
string form of the table we can see that is (-1,A) pos 0
right.
The entire string in position 7 is (6,B) or ABAB. The index 6 alone
refers to a prior string of ABA, specifically the string in POSITION 6,
that's why its called index 6, because it refers backwards to position
6.
In the same way you can compute the string values for each of the
indexes in the output code stream 0 1 4 6 1.
Table Table
Position Index
4 INDEX 0 = A
5 INDEX 1 = B
6 INDEX 4 = AB
7 INDEX 6 = ABA
8 INDEX 1 = B
Thus 0 1 4 6 1 = A B AB ABA B which is what we started with, minus
the spaces which I added for clarity.
GETTING THE TABLE CODES FROM THE TABLE INDEXES.
So what happens if you don't have the table codes, but only the
table indexes? Well you remember that when a string was built that was
NOT in the table, it was then put in the table at the next available
position. Then all characters before the last character were discarded
and the last character was kept as the first character of the next
string to be built.
More accurately once a string is found that is NOT in the table,
say ABAB, this is represented by an (index,code) pair such as (6,B).
The part of the string corresponding to the index is then thrown away
and the remaining single table code becomes the first character of the
next string.
Once a string is built starting with that first character it too is
added to the table and the last character only is kept to become the
first character of the next table entry.
Therefore it is obvious that the last character of each table entry
is the first character of the next table entry! Thus the table is
always of the form,
TABLE TABLE IN
POSITION STRING FORMAT
0 A
1 B (ROOT AREA)
2 C
3 D
4 A...D I have used random characters here for
5 D...C demonstration purposes only. The last
6 C...B character of the string in position 4 is
7 B...D the first character of the string in
8 D position 5, etc. The ... means an
arbitrary number of 0 or more
intervening characters.
So how does this help us find the codes from the indexes alone? It
should be clear from an earlier discussion that from the indexes AND
codes the original string represented by any (index,code) pair can be
reconstructed by following the indexes back to root and accumulating the
codes of each touched upon entry along the way. But if you don't have
the codes how can you accumulate them?!
Well the magic is although you may have no codes to accumulate, you
always have the FIRST code of any string in the table because the first
code of a string is in the root area whose codes are ALWAYS known. Thus
from the indexes alone you can always find the FIRST character of any
string represented by any index.
Here's our complete table again without the codes. Remember root
codes are always known.
TABLE TABLE IN TABLE IN
POSITION STRING FORMAT INDEX,CODE FORMAT
0 A -1 A
1 B -1 B ROOT AREA
2 C -1 C
3 D -1 D
4 AB 0 ? |
5 BA 1 ? ADDED ENTRY
6 ABA 4 ? |
7 ABAB 6 ?
8 B 1 x x means doesn't matter.
For example, in table position 7 you have (6,x).
Index 6 refers to position 6 which contains (4,?), which refers to
position 4 which contains (0,?), which refers to position 0 which
contains (-1,A).
So the string in position 7 MUST start with an A!
But this first character is the LAST character of the immediate
preceding string in the table, in this case the string in position 6.
By definition the last character of a string is that string's table
CODE. So the first character of the string in position 7 is the last
character of the string in position 6 and is thus also 6's table CODE.
(Don't get table codes confused with output codes. A string's
table code is the last character of the string. A string's output code
is the table INDEX for that string!)
Thus by finding the first character of any index string, you can
find the table code of the immediately previous string.
Going back to our previous example, let's assume we have only the
indexes and no codes, except the root codes which are known. The
missing codes are represented by ?'s in the below table.
TABLE TABLE IN TABLE IN
POSITION STRING FORMAT INDEX,CODE FORMAT
0 A -1 A
1 B -1 B ROOT AREA
2 C -1 C
3 D -1 D
4 AB 0 ? |
5 BA 1 ? ADDED ENTRY
6 ABA 4 ? |
7 ABAB 6 ?
8 B 1 x x means doesn't matter.
In position 8 the index 1 points directly to position 1 in in the
root area which has a known code of B. Thus B is the first character of
the string in position 8 and therefore the last character of the string
in position 7. Thus we know the code for position 7, its a B!
In position 7, the index 6 points to position 6 whose index of 4
points to position 4 whose index of 0 points to position 0 which being
in the root area has a known code of A. Thus A is the first character
of the string in position 7 and so also the last character of the string
in position 6. Thus we have the code for 6, its an A.
Visually any index can be followed back to root (6,?) pos 7
just like we did before, the only difference being |
that there are no known codes to accumulate until (4,?) pos 6
we get to root where there will be just one known |
code. That code is the first character of the (0,?) pos 4
index we just traced back and the last character |
of the index just before it in the table. (-1,A) pos 0
Thus by starting with the last added index in the table, and
tracing it back to its first character in the root area, we can find the
table CODE of the immediately prior index. Repeating the process for
that index, we can then fill in the entire table.
Once the table is filled in completely, we can then start a second
pass and accumulate the complete strings for each index using the codes
we just found, and then concatenate those strings together to form the
original input code stream.
Totally amazing, isn't it?
Homer
================ http://www.clearing.org ====================
Tue Sep 5 12:00:02 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/lzw.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZrsoDURT1lqxE3HERAqygAKCXpustFtyezv9Z9kXktJHVmXtRYwCgnNdw
1YVVEFy0KuMbdktW084jVYE=
=I/n7
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
Hash: SHA1
LZW COMPRESSION AND DECOMPRESSION
Copyright (C) 1993 Homer Wilson Smith
Redistribution rights granted for non commercial purposes.
The LZW compression algorithm is probably one of the most mind
boggling algorithms to come along, but it is also one of the most
brilliant, so it is worth understanding well.
It's really quite mind opening.
Ever program something you didn't fully understand, but because it
worked fine you let it go, and then months later found yourself still
wondering why your code worked?
Well that's what happened to me with LZW compression.
My programs worked, for a very long time they worked, until one day
I went to send a large tiff to a color separator, and bang nothing would
read it.
Corel Draw wouldn't read it, CSHOW wouldn't read it, my own damn
tiff program wouldn't read it, and that REALLY pissed me off.
I had written my tiff programs with barely passable understanding
of the algorithm, following along the pseudo code provided by others,
with little personal comprehension myself. I had read a number of
descriptions trying to make LZW compression and decompression clear to
me, but basically all I ended up with was a partial understanding of the
encoding process and no understanding at all of the decoding process. I
kind of programmed it blind, and hoped it would work.
It took me many hours to find the bug, it was one of those 'it
crops up every hundred million years' kind of bug, and I didn't know
what I was doing anyhow, so it wasn't easy.
But from all bad things comes something good (I think) and this
paper is the result. I finally understood both sides of the compression
and decompression dichotomy, and I am reasonably sure my programs will
work because I understand them and not because I followed someone else's
code.
The proof of course is in the pudding, and the pudding is whether
or not I can explain this to others so that they get it the first time.
The algorithm is really quite brilliant, and worth knowing just for the
fun of it.
This paper is not meant to replace everything else you might read
on the subject of LZW encoding or TIFF and GIF files, but it is intended
to make all that other stuff clear. This is what I wish someone had
written for me when I first approached the subject.
WHY DATA COMPRESSION
The problem with data is it takes up so much damn space, and with
the cost of hard disk space and the slowness of telecommunications, it
behooves us to find a way to make data smaller, to make it take up less
room, so that we can then use up the space we free up to fill it with
more data!
It actually takes less time to compress data than it does to
transmit it, so its a good cost saving to compress the data first, then
transmit it and uncompress it at the other end.
RUN LENGTH ENCODING
Various encoding schemes have been devised to take care of this
need, one of the earliest most obvious ones being RUN LENGTH ENCODING.
Run length encoding takes advantage of the fact that often many pixels
right next to each other are the same pixel, so rather than sending them
all one by one they are counted up into a RUN and two bytes are sent
instead, the first byte telling how many pixels there were of one
number, and the next byte the number it was.
Thus a run of pixels that looked like this
5 5 5 3 3 3 9 9 9 9 9 1 1 1 1
would be run length encoded as
3 5 3 3 5 9 4 1
an obvious saving of space. The longer the runs are the more space is
saved as each color run is represented by only two bytes, a count and a
color. If your counts can go only up to 255, then if the run is longer
you have to start a new run, but if your counts can go up to 32767, then
you can handle longer runs before you have to start a new run.
The problem comes in when the data does not consist of large
expanses of identical pixels, who wants to look at a single patch of red
anyhow. A worst case scenario of course is when every pixel is
different such as,
2 3 4 5 6 7 8 9 etc.
Encoding this as RLE would produce,
1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9
which is an obvious waste of space.
One solution to this is to insert an INTRODUCER byte before each
sequence telling whether it is a horizontal run, or a stretch of one
byte per pixel. Thus runs may start with positive counts, and stretches
of one byte per pixel may start with a negative count.
Thus the sequence
3 3 3 3 3 1 2 3 4 5 6
would be compressed as
5 3 -6 1 2 3 4 5 6
giving some compression, but its obviously not an ideal solution.
There is also tremendous complexity involved in programming the
ideal compression for data that has a lot of 2 byte runs in it.
For example,
3 3 4 5 3 3 4 5 3 3 4 5
is better put out as a single stretch of one byte per pixel
-12 3 3 4 5 3 3 4 5 3 3 4 5
rather than as a mixture
2 3 -2 4 5 2 3 -2 4 5 2 3 -2 4 5
because of the the one byte overhead in switching from horizontal runs
to one byte per pixel.
One might make a simple rule that all two byte runs should be put
out as one byte per pixel, except that this is only true if you have
already opened a one byte per pixel stretch, otherwise 2 byte runs
should be put out as a horizontal run (count,byte).
In any case run length encoding (RLE) only produces good compressio
when the data is even and unchanging. Fractals of course are the
antithesis of unchanging data, so RLE does not work well on fractals or
any other natural data like video frames or even written work.
In other words if you have a patch of red to compress use RLE.
Otherwise keep reading.
The LZW Algorithm
There are four concepts that need to be understood. They are,
1.) INPUT CODE
2.) TABLE INDEX
3.) TABLE CODE
4.) OUTPUT CODE
The purpose of LZW compression is to turn the input code stream
into an output code stream of lesser length, and then later to
reconstruct the input code stream from the output code stream. This
accomplishes the purpose of compression and decompression.
The above four concepts can be visualized as follows:
INPUT CODE TABLE OUTPUT CODE
STREAM INDEX CODE STREAM
- ------------------------------------------------------------------------
CODE, CODE, CODE... (INDEX, CODE) CODE, CODE....
(INDEX, CODE)
(INDEX, CODE)
.
.
CODE. A code is a byte wide entity consisting of 8 bits and
ranging in decimal value from 0 to 255. They can be considered as
characters, or as integer numbers, it doesn't matter. They are NOT
signed integers however. INPUT CODES, TABLE CODES and OUTPUT CODES are
all of this format.
INDEX. An index is a two byte wide SIGNED entity consisting of 16
bits and ranging in decimal value from -32768 to 32767. It is called an
index because it refers to an earlier entry in the table. For example,
if table entry number 400 consists of the (index,code) pair (312,5),
then 312 is called a table index and points BACKWARDS to table entry
312, and 5 is a table code generated in the process of compression.
Table entry 312 will itself have an (index,code) pair that will point to
an even earlier table entry, which will point to an earlier table entry
ad infinitum until you come back to the first table entries before which
there are none. These first entries in the table are called the ROOT
AREA.
If a table entry has -1 for an INDEX, that means that that table
entry does NOT refer to any earlier table entry. -1's appear as table
indexes either
1.> when a table entry is still unused or
2.) when it resides in the ROOT AREA as described below.
Table entries in the root area do not point to earlier table
entries because there are no earlier entries.
Table entries that haven't been used yet don't point to earlier
table entries because they haven't been used yet!
In either case the table index will be -1.
0 by the way is a valid table index which points to the very first
table entry in the root area, table entry number 0.
INPUT CODE STREAM. The input code stream is the sequence of bytes
that you wish to compress into a hopefully shorter output code stream.
OUTPUT CODE STREAM. The output code stream is the sequence of
bytes that is the final product of compression, and is hopefully shorter
than the input code stream and RECONSTRUCTIBLE BACK into the input code
stream. It's no good compressing something if you can't uncompress it!
TABLE. The table is a two column table of integer numbers of the
following form:
TABLE
POSITION (INDEX,CODE)
- ------------------------------------------------------------------------
----- 0 (-1 , 000)
| 1 (-1 , 001)
| 2 (-1 , 002)
| . .
ROOT AREA . .
| 255 (-1 , 254)
| 255 (-1 , 255)
| 256 (-1 , 256) Clear Code (CC)
----- 257 (-1 , 257) End of Information Code (EOI)
----- 258 (INDEX,CODE)
| 259 (INDEX,CODE)
ADDED .
ENTRY AREA .
| 278 (INDEX,CODE)
| 279 (INDEX,CODE) <---TABLE POINTER to latest entry
| 270 (-1 , 0) As yet unused entries
| 271 (-1 , 0) "
| . .
----- 4095 (-1 , 0) End of table.
The table consists of only the two columns of numbers, the table
position numbers are NOT in the table and are only shown for clarity.
The table consists of 2 areas, the ROOT area and the ADDED ENTRY
AREA.
ROOT AREA. The root area consists of the first 258 entries in the
table numbered from 0 to 257. The entries from 0 to 255 are initialized
at program start up to the numbers shown and do not change during the
duration of the program. Entries number 256 and 257 are also set during
program start up and are used to control the process of compression and
decompression. Their CODE values are otherwise arbitrarily chosen.
Because their values are greater than 255, table codes must use 16
bit wide integers, even though codes have only 8 significant bits.
The table indexes in the root area are set to -1's because they do
not point to any earlier table entry. The table codes in the root area
are set to the basic alphabet of possible characters in the input code
stream, in this case the integers from 0 to 255. The Codes for
CLEARCODE and END OF INFORMATION CODE are arbitrarily set to 256 and
257.
This leaves table position 258 as the first empty position to ADD
new entries into the table when the compression process actually starts.
ADDED ENTRY AREA. At program start up positions 0 through 257 are
initialized as described above and a pointer is set to the last entered
entry in the table, in this case 257. The remaining table entries are
initialized to (-1,0) as shown and usually there are a total of 4096
entries in the table numbered 0 to 4095, including the root area.
During the process of compression the program scans the input code
stream and adds new entries to the table according to the LZW
compression algorithm which we will discuss at length below. Each new
table entry consists of an (INDEX,CODE) pair which is determined by the
input code stream and the LZW algorithm. As each new (INDEX,CODE) pair
is found the table pointer is incremented by by one and the new
(INDEX,CODE) pair is inserted into the table at the position pointed to
by the table pointer.
In the following discussion we wish to prove the following points.
1.) The table is constructed from and totally determined by the
input code stream. The table is usually shorter than the input code
stream and so compression has taken place in the construction of the
table. This is because each table entry can represent more than one
character in the input code stream.
2.) From the table alone the input code stream can be
reconstructed. Thus if you have the complete table you can reconstruct
the input code stream.
3.) The right hand column of table codes can be reconstructed from
the left hand column of table indexes alone. Thus if you know the left
hand table indexes you can recompute from that information alone the
right hand table codes and thus the input code stream.
4.) Thus the table indexes can act as the final output compressed
data stream, or in other words, the output codes ARE the table indexes
from the added entry area.
Do not get table codes confused with the output codes. The table
INDEXES become the output codes.
Because the table indexes can go up to 4095, they need 12 bits to
represent them. Although they are computed as 16 bit wide integers,
when they are finally output to the output data stream, they are packed
at 12 bits each.
Thus an input data stream of 8 bit integers gets compressed and
output as an output data stream of 12 bit integers.
Since each table index can represent a unique string of varying
length, overall compression takes place.
For example if a single 12 bit wide table index represents the 3
character string of 'ABC' or 24 bits, that is a compression factor of
2:1. Three characters at 8 bits each are compressed into one character
of 12 bits.
5.) The process of uncompressing the output code stream then works
as follows.
First you must rebuild the table indexes from the output code
stream. The ROOT AREA of the table is trivial as it is always the same.
The ADDED ENTRY AREA is almost as trivial. The table index column
of the added entry area IS the sequence of output codes, as the output
codes ARE the table indexes. The table code column of the added entry
area is then recomputed from the table index column by means that will
become obvious when the full algorithm is discussed, and that completes
the rebuilding of the table from the output codes. From the completed
table one can then reconstruct the original input code stream.
So how does LZW work?
The idea behind LZW is that not only do some pixels repeat
themselves, but many SEQUENCES of pixels repeat themselves.
For example take the input code stream (in bytes),
ABCDEABCDEABCDEABCDEABCDE
Such a sequence would not lend itself well to run length encoding
because no single pixel forms a run. However the sequence of 5 pixels
ABCDE certainly form a run as they appear one right after the other 5
times.
One might even suggest a super run length encoding that could seek
out repeating runs of SEQUENCES and perhaps encode a string like
ABCDEABCDEABCDEABCDEFGHFGHFGHFGHFGH
stream as something like,
5(ABCDE) 4(FGH)
However LZW goes one step further and recognizes that the string
ABCDE can appear anywhere in the input code stream, not just in
consecutive runs, so why not just assign the string ABCDE a unique
number, say 234, and then every time that string appears replace it with
the single byte 234.
So if 234 is assigned to ABCDE and 235 is assigned to FGH then the
above 20 byte string could be compressed into the 9 bytes
234 234 234 234 234 235 235 235 235
Of course the number 236 could be assigned to the string ABCDEABCDE
and 237 assigned to FGHFGHFGH, so now the same 20 byte input code stream
could be output as
236 236 234 237 235
Obviously you stand to create a lot of compression this way.
Just as obviously the whole scheme is utterly preposterous, as you
could just assign one number, say 234, to the whole damn text and then
output only that one number!
The problem is clearly keeping track of what string each number
stands for. That is where a string table comes in.
STRING TABLES
A string table is merely a table of strings of varying length and
the code numbers that have been assigned to them. In this case the
string is inserted into the table at the table entry position
corresponding to the code number assigned to that string so that the
code numbers do not also have to stored.
For example let's say we have collected the following table of
strings.
TABLE TABLE
POSITION STRING ENTRY
- ------------------------------------------------------------------------
232 SDF
233 JHIKLNN
234 ABCDE
235 FGH
236 ABCDEABCDE
237 FGHFGHFGH
With such a table in hand it would be easy enough to covert the
output code stream,
236 236 234 237 235
back into the original input stream of
ABCDEABCDE ABCDEABCDE ABCDE FGHFGHFGH FGH
(Without the spaces of course.)
Which is what we want.
The problem of course with this method is that you have to have the
table in order to know what the code numbers stand for, and the space
you save by compressing your input code stream into the smaller sequence
of bytes is mostly lost in having to carry the whole table along with
you.
This becomes obvious in the extreme example of assigning the whole
text one number and putting the whole text in the table as one entry.
You are actually up a byte from the original data, namely the damn code
number. Not a good compression ratio.
The key question is, can the table be reconstructed FROM the output
code stream? If not then you have to carry the table with you to decode
the output code stream, and that wastes space.
If you CAN reconstruct the table from the output code stream then
you can throw the tables away as you produce the output, and recover
them later when you want to go in the other direction.
LZW takes this one step further in that the output code stream IS
the table, at least the left hand column of table indexes, and the right
hand column of table codes can be easily computed from the table
indexes. Once you have both you can recompute the input code stream.
So how does it work?
THE LZW ALGORITHM
The algorithm depends on the idea that any given input string
either is or is not in the table. If it is in the table it is not put
in again. If the string is not in the tale it is immediately put in.
But let's look at how the algorithm gets its strings.
Assume we want to compress the input code stream
ABABABAB
Remember the characters A and B are bytes to the computer and so
are really integer numbers somewhere between 0 and 255. In this case A
is 61 and B is 62.
The algorithm starts with the first character in the input code
stream and continues to grab characters from the input stream building a
string until it builds a string that is NOT in the table.
The string table is first initialized with all possible single
character strings, this forms the root area of the table. Let's
simplify this and just assume for the moment that there are only 4
different single character strings rather than 255, and let's call them
A, B, C, D. Let's also forget the clear code and the end of information
code, so that our root area has just 4 entries in it, numbered 0 through
3. and the first added entry will go in position 4.
Then the table will look like this after initialization.
CODE STRING
0 A
1 B
2 C
3 D
Since ALL possible single character strings ARE in the table in the
root area the very first character that is taken from the input code
stream will definitely be in the table. In this case that is the letter
A.
So nothing is added to the table and the next character is grabbed.
This creates the string AB. AB is NOT in the table so we add it to the
table at position 4.
0 A
1 B
2 C
3 D
4 AB
We now do something very strange, something that will probably earn
LZ&W their Nobel Prize in mathematics: we discard everything in the
string but the last letter of the string and start anew.
So now we have string B which is definitely in the table in the
root area, so we go on and grab the next character in the output code
stream which is another A. The string BA is NOT in the table so we add
it to position 5.
0 A
1 B
2 C
3 D
4 AB
5 BA
We discard all but the last letter of the string leaving us with A
again which is in the table in the root area. We grab the next
character in the input code stream forming AB. Now this time AB is
already in the table from the last time we came across it, so we
continue on to the next character. This gives us ABA. ABA is NOT in
the table so we enter it in position 6.
0 A
1 B
2 C
3 D
4 AB
5 BA
6 ABA
Keeping the last letter A, we grab the next character in the input
code stream forming AB. This is in the table, so we get the next
character forming ABA which is ALSO now in the table. Adding the next
character we get ABAB which is NOT in the table so we add it at position
7.
0 A
1 B
2 C
3 D
4 AB
5 BA
6 ABA
7 ABAB
At this point you can clearly see how to build the rest of the
table from the input code stream. You do this until you run out of
input code stream or table room at which point you clear the table and
start over again with a new table.
Let's assume we ran out of input codes, so as usual we discard all
but the last character of the last string and that leaves B. Since
there are no further codes to add to B, it becomes the last string.
0 A
1 B
2 C
3 D
4 AB
5 BA
6 ABA
7 ABAB
8 B
And there we have our completed table.
Now here is where the brilliance comes in. Each string is added to
the table because it was not already in the table. But each string is
built up one character at a time so each one of its predecessor strings
HAD TO BE IN THE TABLE for that string to get as long as it did before
it got put in the table.
In other words its that LAST CHARACTER at the end of each string in
the table that made that string NOT BE in the table. This means that if
you take any string in the table and remove its last character you must
have a string that was already in the table earlier.
Thus each string can be split up into its last character and an
index into an earlier entry in the table. And voila you have the
(INDEX,CODE) form of the string table.
TABLE TABLE IN TABLE IN
POSITION STRING FORMAT INDEX,CODE FORMAT
0 A -1 A
1 B -1 B ROOT AREA
2 C -1 C
3 D -1 D
4 AB 0 B |
5 BA 1 A ADDED ENTRY
6 ABA 4 A |
7 ABAB 6 B
8 B 1 x x means doesn't matter.
So the first thing we need to demonstrate is that the input code
stream can be reconstructed from the table, particularly from the table
indexes in the added entry area, 0 1 4 6 1.
The first thing we must realize is that each table index refers to
an earlier complete string already in the table.
For example in position 7 there is a (6,B). The 6 refers to
position 6 where there is a (4,A). The 4 refers to position 4 where
there is a (0,B) and the 0 refers to position 0 where there is a (-1,A)
The -1 means you are in the root area and the backwards search ends.
So the (6,B) in position 7 means that position 7 contains a string
which is a B preceded by the string in position 6. But the string in
position 6 is an A preceded by the string in position 4. The string in
position 4 is a B preceded by the string in position 0. And the string
in position 0 is an A preceded by nothing.
So what string does table index 6 refer to? This is the way you
figure it out.
The | means refers to. This says that index 6 (6,B) pos 7
refers to an A preceded by what's in position 4, |
what's in position 4 is a B preceded by what's in (4,A) pos 6
position 0, and what's in position 0 is an A |
preceded by nothing 'cuz its root. This gives (0,B) pos 4
us the string ABA for index 6. Looking in the |
string form of the table we can see that is (-1,A) pos 0
right.
The entire string in position 7 is (6,B) or ABAB. The index 6 alone
refers to a prior string of ABA, specifically the string in POSITION 6,
that's why its called index 6, because it refers backwards to position
6.
In the same way you can compute the string values for each of the
indexes in the output code stream 0 1 4 6 1.
Table Table
Position Index
4 INDEX 0 = A
5 INDEX 1 = B
6 INDEX 4 = AB
7 INDEX 6 = ABA
8 INDEX 1 = B
Thus 0 1 4 6 1 = A B AB ABA B which is what we started with, minus
the spaces which I added for clarity.
GETTING THE TABLE CODES FROM THE TABLE INDEXES.
So what happens if you don't have the table codes, but only the
table indexes? Well you remember that when a string was built that was
NOT in the table, it was then put in the table at the next available
position. Then all characters before the last character were discarded
and the last character was kept as the first character of the next
string to be built.
More accurately once a string is found that is NOT in the table,
say ABAB, this is represented by an (index,code) pair such as (6,B).
The part of the string corresponding to the index is then thrown away
and the remaining single table code becomes the first character of the
next string.
Once a string is built starting with that first character it too is
added to the table and the last character only is kept to become the
first character of the next table entry.
Therefore it is obvious that the last character of each table entry
is the first character of the next table entry! Thus the table is
always of the form,
TABLE TABLE IN
POSITION STRING FORMAT
0 A
1 B (ROOT AREA)
2 C
3 D
4 A...D I have used random characters here for
5 D...C demonstration purposes only. The last
6 C...B character of the string in position 4 is
7 B...D the first character of the string in
8 D position 5, etc. The ... means an
arbitrary number of 0 or more
intervening characters.
So how does this help us find the codes from the indexes alone? It
should be clear from an earlier discussion that from the indexes AND
codes the original string represented by any (index,code) pair can be
reconstructed by following the indexes back to root and accumulating the
codes of each touched upon entry along the way. But if you don't have
the codes how can you accumulate them?!
Well the magic is although you may have no codes to accumulate, you
always have the FIRST code of any string in the table because the first
code of a string is in the root area whose codes are ALWAYS known. Thus
from the indexes alone you can always find the FIRST character of any
string represented by any index.
Here's our complete table again without the codes. Remember root
codes are always known.
TABLE TABLE IN TABLE IN
POSITION STRING FORMAT INDEX,CODE FORMAT
0 A -1 A
1 B -1 B ROOT AREA
2 C -1 C
3 D -1 D
4 AB 0 ? |
5 BA 1 ? ADDED ENTRY
6 ABA 4 ? |
7 ABAB 6 ?
8 B 1 x x means doesn't matter.
For example, in table position 7 you have (6,x).
Index 6 refers to position 6 which contains (4,?), which refers to
position 4 which contains (0,?), which refers to position 0 which
contains (-1,A).
So the string in position 7 MUST start with an A!
But this first character is the LAST character of the immediate
preceding string in the table, in this case the string in position 6.
By definition the last character of a string is that string's table
CODE. So the first character of the string in position 7 is the last
character of the string in position 6 and is thus also 6's table CODE.
(Don't get table codes confused with output codes. A string's
table code is the last character of the string. A string's output code
is the table INDEX for that string!)
Thus by finding the first character of any index string, you can
find the table code of the immediately previous string.
Going back to our previous example, let's assume we have only the
indexes and no codes, except the root codes which are known. The
missing codes are represented by ?'s in the below table.
TABLE TABLE IN TABLE IN
POSITION STRING FORMAT INDEX,CODE FORMAT
0 A -1 A
1 B -1 B ROOT AREA
2 C -1 C
3 D -1 D
4 AB 0 ? |
5 BA 1 ? ADDED ENTRY
6 ABA 4 ? |
7 ABAB 6 ?
8 B 1 x x means doesn't matter.
In position 8 the index 1 points directly to position 1 in in the
root area which has a known code of B. Thus B is the first character of
the string in position 8 and therefore the last character of the string
in position 7. Thus we know the code for position 7, its a B!
In position 7, the index 6 points to position 6 whose index of 4
points to position 4 whose index of 0 points to position 0 which being
in the root area has a known code of A. Thus A is the first character
of the string in position 7 and so also the last character of the string
in position 6. Thus we have the code for 6, its an A.
Visually any index can be followed back to root (6,?) pos 7
just like we did before, the only difference being |
that there are no known codes to accumulate until (4,?) pos 6
we get to root where there will be just one known |
code. That code is the first character of the (0,?) pos 4
index we just traced back and the last character |
of the index just before it in the table. (-1,A) pos 0
Thus by starting with the last added index in the table, and
tracing it back to its first character in the root area, we can find the
table CODE of the immediately prior index. Repeating the process for
that index, we can then fill in the entire table.
Once the table is filled in completely, we can then start a second
pass and accumulate the complete strings for each index using the codes
we just found, and then concatenate those strings together to form the
original input code stream.
Totally amazing, isn't it?
Homer
================ http://www.clearing.org ====================
Tue Sep 5 12:00:02 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/lzw.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZrsoDURT1lqxE3HERAqygAKCXpustFtyezv9Z9kXktJHVmXtRYwCgnNdw
1YVVEFy0KuMbdktW084jVYE=
=I/n7
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
ADORE30 (fwd)
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
HARD AND EASY PRECLEARS
((The terminology used in this posting is backwards from standard
usage.
The bottom of a GPM is the first item in the set, the earliest
encountered on the time track. The preclear sashays UP the GPM to his
present time latest item. So the TOP of the GPM is his present time
item and his top opp term is his present time opponent.
In the below posting it is assumed that the preclear starts at the
'top' first item and sashays 'downward' to his present time mess. It's
merely a matter of terminology, whats bottom or top, the real concept is
first item (earliest on the track) and latest item (latest on the track
in present time.) ))
I think much of the problem with different pcs, is different people
are at different rungs of their present time truncated GPM.
Someone still working on his first rung, will audit easily, he's
aware of what his goals are, he is in alignment with them, every engram
he runs puts him more at cause over that goal etc, he flys.
Someone 15 rungs down is opposing not only his own basic goal, but
also himself. Every engram you run will be a very late on the chain
engram gained while OPPOSING his basic goal, so he only gets better at
opposing himself again. The stuff up at the top of the GPM where the
first rung is located is just not available. He started out to be a
Maurauder ended up being a Messiah, so all he audits are these stupid
crucifixions etc, and that just makes him better at being a Messiah
which he doesn't want to be anyhow, so he gets sicker and sicker.
Also by the time he is at the bottom of his GPM ladder he's a cess
pool of overts and motivators, and he's got 15 Service Facs all in a
row, and you are going to audit 'Standard Tech' through all this?
I think not.
Now one could be a bright puppy and say, well then why don't we
make spotting the PT GPM early on part of Standard Tech? That way we
reorient him towards his original goal of being a Maurauder, and
despense with all the endless case dev-T.
Alan does this.
So really there is 'Standard Tech' and there is application, and
maybe we have everything we need to know, maybe not. It's tempting to
say, 'well you didn't run CCH's long enough', but how long is long
enough? When the pc intensive after intensive just isn't having wins,
isn't VGI's, is loosing in auditing and in life continuously, then its
time to admit 'Well doing it long enough may work, but its not the
proper approach.'
Also you get a pc like me, who is just *FROZEN* in abject terror
about finding out or opening up anything, I mean totally life
threatening terror, then the auditing itself becomes a present time
problem because he doesn't have his will written yet, he's got girl
friends and children that are dependent on him, so he can't afford to
die. So that's going to stop auditing cold because maybe he HAS to die
to get better etc.
Maybe he's scared because his basic goal is too dangerous to know,
maybe the last time he had a thought about that goal the monitors got
him but good etc. So now he's got endless overts opposing his own goals
not only in others but himself.
So yes 'standard tech' will probably unglue the mess, but the pc
doesn't want it unglued! He's still terrorized and on the edge of
dying. He just isn't going to make case gain in the hands of people who
can't stand the thought of someone dying on them in session. Or someone
who can't stand the thought of dying themselves when the pc's demon
exteriorizes and eats the auditor as monster food.
Basically the world consists of 'no fear' cases, its very hard to
make case gain in that atmosphere.
The people at the top of their GPM ladders got no clue what its
like to be at the bottom of their GPM ladder, they look at all this and
just scratch their heads, they just can't see what the problem is but a
little education and mockup processing on the GPM sashay will probably
be sufficient to help them audit the bottom rung case.
The one's at the bottom themselves, still playing the no fear game,
are dangerous auditors. They will dramatize their service facs and
excuses for failure until the pc leaves the church, as the church as
already left him.
Homer
- ------------------------------------------------------------------------
Homer Wilson Smith Clean Air, Clear Water, Art Matrix - Lightlink
(607) 277-0959 A Green Earth and Peace. Internet Access, Ithaca NY
homer@lightlink.com Is that too much to ask? http://www.lightlink.com
================ http://www.clearing.org ====================
Mon Sep 4 12:00:03 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/adore30.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZrXiDURT1lqxE3HERAjH6AJ9H2MX0SjU4BBpx6/LannOyT4XU8ACeIKsY
hkqm058HmUTtF73XHyo7Ugs=
=pB4L
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
Hash: SHA1
HARD AND EASY PRECLEARS
((The terminology used in this posting is backwards from standard
usage.
The bottom of a GPM is the first item in the set, the earliest
encountered on the time track. The preclear sashays UP the GPM to his
present time latest item. So the TOP of the GPM is his present time
item and his top opp term is his present time opponent.
In the below posting it is assumed that the preclear starts at the
'top' first item and sashays 'downward' to his present time mess. It's
merely a matter of terminology, whats bottom or top, the real concept is
first item (earliest on the track) and latest item (latest on the track
in present time.) ))
I think much of the problem with different pcs, is different people
are at different rungs of their present time truncated GPM.
Someone still working on his first rung, will audit easily, he's
aware of what his goals are, he is in alignment with them, every engram
he runs puts him more at cause over that goal etc, he flys.
Someone 15 rungs down is opposing not only his own basic goal, but
also himself. Every engram you run will be a very late on the chain
engram gained while OPPOSING his basic goal, so he only gets better at
opposing himself again. The stuff up at the top of the GPM where the
first rung is located is just not available. He started out to be a
Maurauder ended up being a Messiah, so all he audits are these stupid
crucifixions etc, and that just makes him better at being a Messiah
which he doesn't want to be anyhow, so he gets sicker and sicker.
Also by the time he is at the bottom of his GPM ladder he's a cess
pool of overts and motivators, and he's got 15 Service Facs all in a
row, and you are going to audit 'Standard Tech' through all this?
I think not.
Now one could be a bright puppy and say, well then why don't we
make spotting the PT GPM early on part of Standard Tech? That way we
reorient him towards his original goal of being a Maurauder, and
despense with all the endless case dev-T.
Alan does this.
So really there is 'Standard Tech' and there is application, and
maybe we have everything we need to know, maybe not. It's tempting to
say, 'well you didn't run CCH's long enough', but how long is long
enough? When the pc intensive after intensive just isn't having wins,
isn't VGI's, is loosing in auditing and in life continuously, then its
time to admit 'Well doing it long enough may work, but its not the
proper approach.'
Also you get a pc like me, who is just *FROZEN* in abject terror
about finding out or opening up anything, I mean totally life
threatening terror, then the auditing itself becomes a present time
problem because he doesn't have his will written yet, he's got girl
friends and children that are dependent on him, so he can't afford to
die. So that's going to stop auditing cold because maybe he HAS to die
to get better etc.
Maybe he's scared because his basic goal is too dangerous to know,
maybe the last time he had a thought about that goal the monitors got
him but good etc. So now he's got endless overts opposing his own goals
not only in others but himself.
So yes 'standard tech' will probably unglue the mess, but the pc
doesn't want it unglued! He's still terrorized and on the edge of
dying. He just isn't going to make case gain in the hands of people who
can't stand the thought of someone dying on them in session. Or someone
who can't stand the thought of dying themselves when the pc's demon
exteriorizes and eats the auditor as monster food.
Basically the world consists of 'no fear' cases, its very hard to
make case gain in that atmosphere.
The people at the top of their GPM ladders got no clue what its
like to be at the bottom of their GPM ladder, they look at all this and
just scratch their heads, they just can't see what the problem is but a
little education and mockup processing on the GPM sashay will probably
be sufficient to help them audit the bottom rung case.
The one's at the bottom themselves, still playing the no fear game,
are dangerous auditors. They will dramatize their service facs and
excuses for failure until the pc leaves the church, as the church as
already left him.
Homer
- ------------------------------------------------------------------------
Homer Wilson Smith Clean Air, Clear Water, Art Matrix - Lightlink
(607) 277-0959 A Green Earth and Peace. Internet Access, Ithaca NY
homer@lightlink.com Is that too much to ask? http://www.lightlink.com
================ http://www.clearing.org ====================
Mon Sep 4 12:00:03 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/adore30.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZrXiDURT1lqxE3HERAjH6AJ9H2MX0SjU4BBpx6/LannOyT4XU8ACeIKsY
hkqm058HmUTtF73XHyo7Ugs=
=pB4L
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
Sunday, September 3, 2017
ADORE392 (fwd)
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
MEN AND WOMEN
The following is about MORTAL men and MORTAL women.
Mortal means the being believes incorrectly that they live once,
die once and that's it bud.
Neither understand that they are a full instantiation of God in
carnation.
Mortal women think the universe is womanly.
Mortal men think the universe is manly.
Neither understands that the universe is divine.
From Adore:
Mortal men fight wars with each other because they can't stand
their mothers.
They want to kill their mothers, but unable to do so they take to
killing each other.
Eventually they get the other guy to kill their mothers for them.
Any man who mistreats women hates his mother, the women he
mistreats are substitutes for his mother.
Mortal women criticize in men what they are jealous of.
What the man hates in his mother, is his mother's refusal to
operate in the man what the man has, which the women doesn't have and
which the women needs and is jealous of, which is mastery of offense and
to be leaders of women and their children.
To lead means to have others follow you where you can and have
gone, so they can go there too.
But just as a child does not go where a woman goes until it grows
up, women does not go where the man goes until the woman becomes a man
in a next life.
There will always be exceptions, and this applies mostly to mortal
women with child.
Women seek mastery of defense.
Men seek master of offence.
Women can not go where she can not take her children, the man is
not so limited.
Her tits are a symbol to women of this limitation.
Her hatred of her tits, her womanhood and of men are the source of
her breast cancer.
Get the idea of a woman giving a male child a cancerous tit.
The purpose of the man is to seek out danger before it finds him.
NO women with child operates that way.
Men take their vision statement from women.
Women take their mission statement from men.
Vision statement is where we want or need to go.
Mission statement is how to get there.
Vision is a better world through better children.
Mission is shut up bitch, and let us build the fucking school
already, and while you are at it, feed the men :)
The woman's place is not in the kitchen, nor the home, nor even the
homestead.
The woman's place is WITH THE CHILDREN first, and after that
maintaining the supply lines and care facilities for the men who are
going out of bounds to seek danger before it seeks them.
Leadership is the ability to lead the MISSION.
Thus men are the leaders of women and children, and take point on
the journey.
Can you imagine a man saying to his wife with child "You take
point!"
Of course you might have to search a while to find a real man
considering what women are issuing from their wombs.
Although women take their marching orders from men, men get their
vision statement from women. Without that vision statement, men can not
operate and will turn against their women by turning against each other.
This is the source of insanity in wars.
This is particularly true when the woman's highest vision is that
everyone should be womyn.
"The highest pleasure of an (insane) warrior to see the burning
villages of his enemies and to hear the wailing of their women. -
Conan.
When it comes to the children, the man is pilot and the woman is co
pilot.
Women who can't stand being co pilot will marry inferior men who
are unworthy of being pilot, and then use them as proof that men and
women are 'equal', or that women can do anything a man can do only
better.
The above material is not acceptable to mortal women, they do not
take kindly to having their jealousy missed.
Hyper critical of men = Jealousy.
Yes men misbehave, the jealous woman wishes she could too, and get
away with it.
Such sweet beings, women are.
Where men are overtly destructive, women are covertly destructive.
The above is not acceptable to mortal men, who are still trying to
get laid, or who are on the verge of becoming mortal women themselves in
their next life.
Women are fully responsible for how their men turn out.
Women are an incubator for true manhood.
Since women will never take full responsibliity for the issue of
their wombs, the future of Earth is grim.
Homer
- ------------------------------------------------------------------------
Homer Wilson Smith The Paths of Lovers Art Matrix - Lightlink
(607) 277-0959 KC2ITF Cross Internet Access, Ithaca NY
homer@lightlink.com In the Line of Duty http://www.lightlink.com
Sat Sep 9 02:35:12 EDT 2006
================ http://www.clearing.org ====================
Sun Sep 3 12:00:03 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/adore392.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZrCcDURT1lqxE3HERApgNAJ95LMQ8MZ9AWgYH3jd9nzdUpvyZywCffBFR
bak+2kAR8H8jf6IyzmqieBU=
=NTmN
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
Hash: SHA1
MEN AND WOMEN
The following is about MORTAL men and MORTAL women.
Mortal means the being believes incorrectly that they live once,
die once and that's it bud.
Neither understand that they are a full instantiation of God in
carnation.
Mortal women think the universe is womanly.
Mortal men think the universe is manly.
Neither understands that the universe is divine.
From Adore:
Mortal men fight wars with each other because they can't stand
their mothers.
They want to kill their mothers, but unable to do so they take to
killing each other.
Eventually they get the other guy to kill their mothers for them.
Any man who mistreats women hates his mother, the women he
mistreats are substitutes for his mother.
Mortal women criticize in men what they are jealous of.
What the man hates in his mother, is his mother's refusal to
operate in the man what the man has, which the women doesn't have and
which the women needs and is jealous of, which is mastery of offense and
to be leaders of women and their children.
To lead means to have others follow you where you can and have
gone, so they can go there too.
But just as a child does not go where a woman goes until it grows
up, women does not go where the man goes until the woman becomes a man
in a next life.
There will always be exceptions, and this applies mostly to mortal
women with child.
Women seek mastery of defense.
Men seek master of offence.
Women can not go where she can not take her children, the man is
not so limited.
Her tits are a symbol to women of this limitation.
Her hatred of her tits, her womanhood and of men are the source of
her breast cancer.
Get the idea of a woman giving a male child a cancerous tit.
The purpose of the man is to seek out danger before it finds him.
NO women with child operates that way.
Men take their vision statement from women.
Women take their mission statement from men.
Vision statement is where we want or need to go.
Mission statement is how to get there.
Vision is a better world through better children.
Mission is shut up bitch, and let us build the fucking school
already, and while you are at it, feed the men :)
The woman's place is not in the kitchen, nor the home, nor even the
homestead.
The woman's place is WITH THE CHILDREN first, and after that
maintaining the supply lines and care facilities for the men who are
going out of bounds to seek danger before it seeks them.
Leadership is the ability to lead the MISSION.
Thus men are the leaders of women and children, and take point on
the journey.
Can you imagine a man saying to his wife with child "You take
point!"
Of course you might have to search a while to find a real man
considering what women are issuing from their wombs.
Although women take their marching orders from men, men get their
vision statement from women. Without that vision statement, men can not
operate and will turn against their women by turning against each other.
This is the source of insanity in wars.
This is particularly true when the woman's highest vision is that
everyone should be womyn.
"The highest pleasure of an (insane) warrior to see the burning
villages of his enemies and to hear the wailing of their women. -
Conan.
When it comes to the children, the man is pilot and the woman is co
pilot.
Women who can't stand being co pilot will marry inferior men who
are unworthy of being pilot, and then use them as proof that men and
women are 'equal', or that women can do anything a man can do only
better.
The above material is not acceptable to mortal women, they do not
take kindly to having their jealousy missed.
Hyper critical of men = Jealousy.
Yes men misbehave, the jealous woman wishes she could too, and get
away with it.
Such sweet beings, women are.
Where men are overtly destructive, women are covertly destructive.
The above is not acceptable to mortal men, who are still trying to
get laid, or who are on the verge of becoming mortal women themselves in
their next life.
Women are fully responsible for how their men turn out.
Women are an incubator for true manhood.
Since women will never take full responsibliity for the issue of
their wombs, the future of Earth is grim.
Homer
- ------------------------------------------------------------------------
Homer Wilson Smith The Paths of Lovers Art Matrix - Lightlink
(607) 277-0959 KC2ITF Cross Internet Access, Ithaca NY
homer@lightlink.com In the Line of Duty http://www.lightlink.com
Sat Sep 9 02:35:12 EDT 2006
================ http://www.clearing.org ====================
Sun Sep 3 12:00:03 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/adore392.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZrCcDURT1lqxE3HERApgNAJ95LMQ8MZ9AWgYH3jd9nzdUpvyZywCffBFR
bak+2kAR8H8jf6IyzmqieBU=
=NTmN
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
ADORE748 (fwd)
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
SASHAY OF THE CHURCH
In alt.clearing.technology husk <husk@mailinator.com> wrote:
> There's a lot in that post. I'll need to go through it a couple of
> times.
>
> I take it anything after 1955 was pursuit of money.
Too simple minded.
The Churches descent was a massive and complex affair with
many causal factors, greed and fear of non survival and outright
paranoia and preemptive war bound polices among them.
The need for money is obvious, you can't build a world wide church
without it.
However the real changes taking place was caused by what Scn would
call a sashay down a GPM structure, starting at the beginning with the
goal to free people, and ending at the bottom with the goal to enslave
people.
Probably about 16 to 20 distinct steps along the way.
If you take a look at Hubbard's life, the money certainly didn't go
to him, but the organization itself kind of had a desire for survival
through power, control and of course wealth, be it money or whatever.
They do want to control the world you know.
As for the tech, in parallel with the decay of the ethics of the
organization as a whole, Hubbard found that people just couldn't run pre
1952 stuff. So he had to go lower and lower down the bridge to bring
processes to people who could barely talk to each other, and who had so
many withholds as a normal course of life, their minds looked like a can
of worms.
The first people in Scn, 1952 say, were already out of body,
or near out of body, called step 1's and 2's.
A step 1 could be out just by considering it.
A step 2 could PUSH himself out with mental force beams directed at
his forehead, and pull beams directed at the walls of the room. He was
lost in the illusion of force and mechanics and considered himself a
newtonian entity like a marble.
So Ron developed processes to stabilize them outside, mostly mockup
processing, and also to take back from the body all the ability and
personality they had assigned to it which was really theirs.
Step 3's and 4's were lower tone and needed 'earlier' processing,
which was actually developed later, but meant for lower tone cases that
had to be run first, in order to get them to step 1.
A step three was able to make mental space time, and was practiced
on this until he exteriorized.
A stop 4 could not make space but could barely hold a single point
still. So he was practiced on this until he became a step 3, then ran
spaction until a 2 and then considerations until a 1 etc.
Hubbard was always most interested in OT's, people who were out of
body or could get out easily, and developing their exterior abilities to
really get them free of getting involved in body games again which is
pretty much the death of anyone.
But he ran out early of step 1's, so had to deal with step 2's,
then 3's and 4's. Then he really ran out, because most of mankind is
down in the step 5 and step 6 area, no clue, never been out, can't get
out, all black, don't believe it, all circuits, bank talks for them,
etc.
If you follow the issue closely across 1952 to 1955 say, you will
find he issued many versions of the Standard Operating Procedure for
clearing. It was always devoted to steps 1 through 4.
He would deal with step 5's (all black no mockups) and below with a
single paragraph, something like "If pc can't get mockups, remedy
havingness on black masses".
In otherwords, the pc is stuck in black masses, so make
more of them until it clears.
Right. Sure that process will work, across 10**98 hours.
In other words dealing with the step 5-7 was so hard and
impossible, that it just wasn't worth it.
So Hubbard got good at dealing with 1-4, and claiming to have easy
processes to help the 5 become a 4, BUT NEVER ACTUALLY USING THEM, he
left 5's and below behind. They just didn't show up for auditing, and
Hubbard has happy to have it so.
For one 5's and 4's didn't get along, because a 4 was at the bottom
half of the God range, and the 5 was at the top half of the soul/human
range, and souls just hate gods.
The usual thought in a 5's head towards a 4 was 'why don't you just
as-is my case for me!'
More practically the auditing of 5's was so slow they didn't have
enough money to pay for their own case gain.
The 4 is trying to become a 1, the 5 is trying to become a better 5
with some super powers to protect his 5ness.
So you got tomes and tomes of stuff to deal with steps 1-4 which
were relatively easy to exteriorize and stabilize, and nothing to deal
with steps 5-7 which were impossible to audit but which were the vast
majority of human beings.
Somewhere after the 50's he simply ran out of step 1-4s on Earth, I
mean a handful, a few hundred maybe, and was stuck with 5 billion step
5-7's.
So the remainder of Scientology then by necessity was directed at
helping lower level preclears get up to a point where they weren't lying
to themselves complusively, able to talk to an auditor and then make
some general case gain.
Notice in Creation of Human Ability, how many processes are there
for Route 1 (steps 1-4), just a few, and how many for route 2 (5-7)
hundreds! That's because auditing below step 4 is auditing stone. At 4
and above you have a being talking to you, at 5 and below you have a
Newtonian nutcake marble. Thinks he's meat etc, will defend it to the
death, the whole thing.
The church began to fill up with 5's and 6's, none of whom ever
made any real case gain, and although hopeful, had little clue of what a
Godsoul is really like in the God state, and remained mortal meat until
the day they left in disgust.
They left a better 5, but never reached 4.
A 5 is a pretty well off human, a 4 is a very sick God.
Also because of the proliferation of failed 5's in the Church, when
a true 4 or 3 walked in, possibly in good comm with disincarnates, they
were treated as a 5 or a 7, declared PTS Type 3, (Potential Trouble
Source type 3, sees imaginary beings around him), and were never able to
make case gain either.
The 4 who was in actual communication with other disincarnate
beings was confused as a 7 who was halluinating beings that didn't
exist.
5's don't believe in disincarnate beings, even in the Church where
they aren't even allowed to talk about them, so anyone walking in that
is talking to or about other beings, or bothered by them HAS to be a 7
you see?
And from there on down the Church went to hell in a hand basket.
Eventually what happens in such groups, is they go out of valence
in OT III (freedom from overwhelm,) and they stay out of overwhelm
themselevs by dramatizing overwhelming others. And if you cross their
path, you either get assimilated into their out of valence dramatization
and help them overwhelm others, or they start overwhelming you.
That's OT III at its proud and glorious best.
Which is why anyone not at OT III or above is kind of a danger to
be around, and why almost no one runs OT III out, too easy to remain
unoverwhelmed by dramatizing overwhelming others.
But even an OT III is a pretty sick step 4.
People who are out of valence feel 'just fine' even though they are
dramatizing a time when they were tortured to death because they are
torturing others to death in present time. Should they stop and
consider for a moment, then they don't feel so good... :)
The overwhelm of OT III was a whopper, imagine standing on the
edge of Mount Saint Helens right on the lip of the caldera and the
lid blows. The compression wave takes about 3 seconds to cross
space and time to you....
Now imagine later being a Churchie, and you are talking to someone
on the street, and they are being a human being, and you are being Mount
Saint Helens.
Homer
- --
- ------------------------------------------------------------------------
Homer Wilson Smith The Paths of Lovers Art Matrix - Lightlink (607)
277-0959 KC2ITF Cross Internet Access, Ithaca NY homer@lightlink.com In
the Line of Duty http://www.lightlink.com
Wed Apr 7 15:30:44 EDT 2010
================ http://www.clearing.org ====================
Sat Sep 2 12:00:03 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/adore748.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZqtWDURT1lqxE3HERAi/OAJ4yjeE+nfTl8d/BthJjEd1VLm4CeACcCS6o
3WSLomBFZkY5Js2+GZuNBcc=
=pCa7
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
Hash: SHA1
SASHAY OF THE CHURCH
In alt.clearing.technology husk <husk@mailinator.com> wrote:
> There's a lot in that post. I'll need to go through it a couple of
> times.
>
> I take it anything after 1955 was pursuit of money.
Too simple minded.
The Churches descent was a massive and complex affair with
many causal factors, greed and fear of non survival and outright
paranoia and preemptive war bound polices among them.
The need for money is obvious, you can't build a world wide church
without it.
However the real changes taking place was caused by what Scn would
call a sashay down a GPM structure, starting at the beginning with the
goal to free people, and ending at the bottom with the goal to enslave
people.
Probably about 16 to 20 distinct steps along the way.
If you take a look at Hubbard's life, the money certainly didn't go
to him, but the organization itself kind of had a desire for survival
through power, control and of course wealth, be it money or whatever.
They do want to control the world you know.
As for the tech, in parallel with the decay of the ethics of the
organization as a whole, Hubbard found that people just couldn't run pre
1952 stuff. So he had to go lower and lower down the bridge to bring
processes to people who could barely talk to each other, and who had so
many withholds as a normal course of life, their minds looked like a can
of worms.
The first people in Scn, 1952 say, were already out of body,
or near out of body, called step 1's and 2's.
A step 1 could be out just by considering it.
A step 2 could PUSH himself out with mental force beams directed at
his forehead, and pull beams directed at the walls of the room. He was
lost in the illusion of force and mechanics and considered himself a
newtonian entity like a marble.
So Ron developed processes to stabilize them outside, mostly mockup
processing, and also to take back from the body all the ability and
personality they had assigned to it which was really theirs.
Step 3's and 4's were lower tone and needed 'earlier' processing,
which was actually developed later, but meant for lower tone cases that
had to be run first, in order to get them to step 1.
A step three was able to make mental space time, and was practiced
on this until he exteriorized.
A stop 4 could not make space but could barely hold a single point
still. So he was practiced on this until he became a step 3, then ran
spaction until a 2 and then considerations until a 1 etc.
Hubbard was always most interested in OT's, people who were out of
body or could get out easily, and developing their exterior abilities to
really get them free of getting involved in body games again which is
pretty much the death of anyone.
But he ran out early of step 1's, so had to deal with step 2's,
then 3's and 4's. Then he really ran out, because most of mankind is
down in the step 5 and step 6 area, no clue, never been out, can't get
out, all black, don't believe it, all circuits, bank talks for them,
etc.
If you follow the issue closely across 1952 to 1955 say, you will
find he issued many versions of the Standard Operating Procedure for
clearing. It was always devoted to steps 1 through 4.
He would deal with step 5's (all black no mockups) and below with a
single paragraph, something like "If pc can't get mockups, remedy
havingness on black masses".
In otherwords, the pc is stuck in black masses, so make
more of them until it clears.
Right. Sure that process will work, across 10**98 hours.
In other words dealing with the step 5-7 was so hard and
impossible, that it just wasn't worth it.
So Hubbard got good at dealing with 1-4, and claiming to have easy
processes to help the 5 become a 4, BUT NEVER ACTUALLY USING THEM, he
left 5's and below behind. They just didn't show up for auditing, and
Hubbard has happy to have it so.
For one 5's and 4's didn't get along, because a 4 was at the bottom
half of the God range, and the 5 was at the top half of the soul/human
range, and souls just hate gods.
The usual thought in a 5's head towards a 4 was 'why don't you just
as-is my case for me!'
More practically the auditing of 5's was so slow they didn't have
enough money to pay for their own case gain.
The 4 is trying to become a 1, the 5 is trying to become a better 5
with some super powers to protect his 5ness.
So you got tomes and tomes of stuff to deal with steps 1-4 which
were relatively easy to exteriorize and stabilize, and nothing to deal
with steps 5-7 which were impossible to audit but which were the vast
majority of human beings.
Somewhere after the 50's he simply ran out of step 1-4s on Earth, I
mean a handful, a few hundred maybe, and was stuck with 5 billion step
5-7's.
So the remainder of Scientology then by necessity was directed at
helping lower level preclears get up to a point where they weren't lying
to themselves complusively, able to talk to an auditor and then make
some general case gain.
Notice in Creation of Human Ability, how many processes are there
for Route 1 (steps 1-4), just a few, and how many for route 2 (5-7)
hundreds! That's because auditing below step 4 is auditing stone. At 4
and above you have a being talking to you, at 5 and below you have a
Newtonian nutcake marble. Thinks he's meat etc, will defend it to the
death, the whole thing.
The church began to fill up with 5's and 6's, none of whom ever
made any real case gain, and although hopeful, had little clue of what a
Godsoul is really like in the God state, and remained mortal meat until
the day they left in disgust.
They left a better 5, but never reached 4.
A 5 is a pretty well off human, a 4 is a very sick God.
Also because of the proliferation of failed 5's in the Church, when
a true 4 or 3 walked in, possibly in good comm with disincarnates, they
were treated as a 5 or a 7, declared PTS Type 3, (Potential Trouble
Source type 3, sees imaginary beings around him), and were never able to
make case gain either.
The 4 who was in actual communication with other disincarnate
beings was confused as a 7 who was halluinating beings that didn't
exist.
5's don't believe in disincarnate beings, even in the Church where
they aren't even allowed to talk about them, so anyone walking in that
is talking to or about other beings, or bothered by them HAS to be a 7
you see?
And from there on down the Church went to hell in a hand basket.
Eventually what happens in such groups, is they go out of valence
in OT III (freedom from overwhelm,) and they stay out of overwhelm
themselevs by dramatizing overwhelming others. And if you cross their
path, you either get assimilated into their out of valence dramatization
and help them overwhelm others, or they start overwhelming you.
That's OT III at its proud and glorious best.
Which is why anyone not at OT III or above is kind of a danger to
be around, and why almost no one runs OT III out, too easy to remain
unoverwhelmed by dramatizing overwhelming others.
But even an OT III is a pretty sick step 4.
People who are out of valence feel 'just fine' even though they are
dramatizing a time when they were tortured to death because they are
torturing others to death in present time. Should they stop and
consider for a moment, then they don't feel so good... :)
The overwhelm of OT III was a whopper, imagine standing on the
edge of Mount Saint Helens right on the lip of the caldera and the
lid blows. The compression wave takes about 3 seconds to cross
space and time to you....
Now imagine later being a Churchie, and you are talking to someone
on the street, and they are being a human being, and you are being Mount
Saint Helens.
Homer
- --
- ------------------------------------------------------------------------
Homer Wilson Smith The Paths of Lovers Art Matrix - Lightlink (607)
277-0959 KC2ITF Cross Internet Access, Ithaca NY homer@lightlink.com In
the Line of Duty http://www.lightlink.com
Wed Apr 7 15:30:44 EDT 2010
================ http://www.clearing.org ====================
Sat Sep 2 12:00:03 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/adore748.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZqtWDURT1lqxE3HERAi/OAJ4yjeE+nfTl8d/BthJjEd1VLm4CeACcCS6o
3WSLomBFZkY5Js2+GZuNBcc=
=pCa7
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
Friday, September 1, 2017
ADORE781 (fwd)
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
08/02/10 Monday 2:22pm EST
INDIRECT AND DIRECT PERCEPTIONS
If in fact perfect certainties do not exist, then it follows that
you will never attain a perfect certainty of that fact.
This forever leaves open the door that perfect certainties might in
fact exist.
The question then becomes, how do you go about finding such a
thing, and how would you know a perfect certainty if you found one?
First thing is that a perfect certainty would have to be totally
self sustaining, meaning no further or other data, evidence or
perception would be necessary to support them.
Second perfect certainties can never be had through indirect
perception which gives rise only to theories comprised of model and
evidence.
Indirect perception is defined as learning about A by looking at B,
under the assumption that B's state is a caused function of A's state.
Third all direct perceptions will give rise to a perfect certainty,
and all perfect certainties will involve a direct perception.
Direct perception is defined as learning about A by looking at A
directly.
Thus to spot a perfect certainty one would need to spot a direct
perception.
For a conscious unit, all indirect perceptions ultimately terminate
in a direct perception, otherwise the conscious unit would have
perceived nothing.
Once a direct perception is found, the utter irrelevancy of perfect
certainties to our lives needs to be run out until there is a fair
chosen balance of relevancy between indirect perceptions and direct
perceptions.
Run,
Spot an indirect perception.
Spot a direct perception.
Homer
- ------------------------------------------------------------------------
Homer Wilson Smith The Paths of Lovers Art Matrix - Lightlink
(607) 277-0959 KC2ITF Cross Internet Access, Ithaca NY
homer@lightlink.com In the Line of Duty http://www.lightlink.com
Mon Aug 2 14:54:07 EDT 2010
================ http://www.clearing.org ====================
Fri Sep 1 12:00:03 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/adore781.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZqYQDURT1lqxE3HERAqLeAJ99NVGLALCgUgEg6irFPZe55p3yGQCfSKQr
4I/s7ijaWkAqgbIYzGJksMw=
=TmXN
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
Hash: SHA1
08/02/10 Monday 2:22pm EST
INDIRECT AND DIRECT PERCEPTIONS
If in fact perfect certainties do not exist, then it follows that
you will never attain a perfect certainty of that fact.
This forever leaves open the door that perfect certainties might in
fact exist.
The question then becomes, how do you go about finding such a
thing, and how would you know a perfect certainty if you found one?
First thing is that a perfect certainty would have to be totally
self sustaining, meaning no further or other data, evidence or
perception would be necessary to support them.
Second perfect certainties can never be had through indirect
perception which gives rise only to theories comprised of model and
evidence.
Indirect perception is defined as learning about A by looking at B,
under the assumption that B's state is a caused function of A's state.
Third all direct perceptions will give rise to a perfect certainty,
and all perfect certainties will involve a direct perception.
Direct perception is defined as learning about A by looking at A
directly.
Thus to spot a perfect certainty one would need to spot a direct
perception.
For a conscious unit, all indirect perceptions ultimately terminate
in a direct perception, otherwise the conscious unit would have
perceived nothing.
Once a direct perception is found, the utter irrelevancy of perfect
certainties to our lives needs to be run out until there is a fair
chosen balance of relevancy between indirect perceptions and direct
perceptions.
Run,
Spot an indirect perception.
Spot a direct perception.
Homer
- ------------------------------------------------------------------------
Homer Wilson Smith The Paths of Lovers Art Matrix - Lightlink
(607) 277-0959 KC2ITF Cross Internet Access, Ithaca NY
homer@lightlink.com In the Line of Duty http://www.lightlink.com
Mon Aug 2 14:54:07 EDT 2010
================ http://www.clearing.org ====================
Fri Sep 1 12:00:03 EDT 2017
WEB: http://www.clearing.org
BLOG: http://adoretheproof.blogspot.org
FTP: ftp://ftp.lightlink.com/pub/archive/homer/adore781.memo
Send mail to archive@lightlink.com saying help in body
=========== http://www.lightlink.com/theproof ===============
Learning implies Learning with Certainty or Learning without Certainty.
Learning across a Distance implies Learning by Being an Effect.
Learning by Being an Effect implies Learning without Certainty.
Therefore, Learning with Certainty implies Learning,
but not by Being an Effect, and not across a Distance.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.5 (GNU/Linux)
iD8DBQFZqYQDURT1lqxE3HERAqLeAJ99NVGLALCgUgEg6irFPZe55p3yGQCfSKQr
4I/s7ijaWkAqgbIYzGJksMw=
=TmXN
-----END PGP SIGNATURE-----
_______________________________________________
HomerWSmith-L mailing list
HomerWSmith-L@mailman.lightlink.com
http://mailman.lightlink.com/mailman/listinfo/homerwsmith-l
Subscribe to:
Posts (Atom)