| |
 |
|
|
Science Forum Index » Fractals Science Forum » Text Seeding C1,C2 & C3
Page 1 of 1
|
| Author |
Message |
| Simon |
Posted: Sat Dec 01, 2007 4:52 pm |
|
|
|
Guest
|
Hi how you doing? I have been exploring text seeding with fractals
utilizing a 5000 year old fractal called the i-ching, I have come up with
some effective code for fractal seeding, you can get a copy of this
software which I wrote into Fractal Studio by Erling Andersen, off my
website..
Download: http://bin.chronolabs.org.au/Augmented%20Fractals.msi
This method of text seeding allow you to compare words in fractals and
leaves me in the notion that every word and every phrase has a finite
number associated with it. Let me know if you want a copy of the source, I
will ammended it to a blog here on usenet.
--
-----------------------------------------------------------------------
Simon Roberts
Chronolabs Australia
http://www.chronolabs.org.au/
http://www.extraterrestrialembassy.com/
-----------------------------------------------------------------------
Disclaimer: The information transmitted is intended only for the person or
entity to which it is addressed and may contain confidential and / or
privileged material. Any review, transmission, dissemination or other use
of, or taking of any action in reliance upon, this information by persons
or entities other than the intended recipient is prohibited. If you
received this in error, please contact the sender and delete the material
from any computer in your company. |
|
|
| Back to top |
|
| Roger Bagula |
Posted: Tue Dec 04, 2007 11:21 am |
|
|
|
Guest
|
Simon wrote:
Quote: Hi how you doing? I have been exploring text seeding with fractals
utilizing a 5000 year old fractal called the i-ching, I have come up with
some effective code for fractal seeding, you can get a copy of this
software which I wrote into Fractal Studio by Erling Andersen, off my
website..
Download: http://bin.chronolabs.org.au/Augmented%20Fractals.msi
This method of text seeding allow you to compare words in fractals and
leaves me in the notion that every word and every phrase has a finite
number associated with it. Let me know if you want a copy of the source, I
will ammended it to a blog here on usenet.
Simon,
I have done some analysis on the IChing: ( and A116586
<http://www.research.att.com/%7Enjas/sequences/A116586>)
A116594 <http://www.research.att.com/%7Enjas/sequences/A116594>
a^n*b^m ordering of *IChing* symbol numbers.
+30
1
1, 9, 10, 13, 14, 43, 44, 5, 6, 25, 26, 28, 30, 33, 34, 37, 38, 49, 50,
57, 58, 61, 11, 12, 17, 18, 21, 22, 31, 32, 41, 42, 47, 48, 53, 54, 55,
56, 59, 60, 63, 64, 3, 4, 19, 20, 27, 29, 35, 36, 39, 40, 45, 46, 51,
52, 62, 7, 8, 15, 16, 23, 24, 2 (list
<http://www.research.att.com/%7Enjas/sequences/table?a=116594&fmt=4>;
graph
<http://www.research.att.com/%7Enjas/sequences/table?a=116594&fmt=5>;
listen
<http://www.research.att.com/%7Enjas/sequences/table?a=116594&fmt=6>)
OFFSET
0,2
COMMENT
Traditional Chinese question answering symbols usually taken in a random
order of drawing. The *IChing* is a Pascal Polynomial base: (x+1)6
1,6,15,20,6,1 Two symbols taken six at a time to 64 total symbols. It is
part of the famous "Eight Fold Way" in Chinese mysticism. The draw is
eight at random and use the symbols they "mean" to interpret a
"question". It sort of like a "yes" or "no" using a coin toss only with
a book to interpret the results. Questions have to be formulated in a
specific format. Think of each *IChing* symbol as the result of six coin
tosses. So taking 8 symbols is like 48 =8*6 coin tosses in a row. It
will noticed in this ordering by binomial types that there is a pattern
of pairing of symbols by number.
REFERENCES
John Blofeld, The Book of Change, Dutton, New York,1968, Page 222
http://www.uponreflection.co.uk/*iching*/*iching*_symbols/*iching*_symbols.htm
FORMULA
I sorted them by a^n*b*m: a6*b0->1 a5*b1->9,10,13,14,43,44
a4*b2->5,6,25,26,28,30,33,34,37,38,49,50,57,58,61
a3*b3->11,12,17,18,21,22,31,32,41,42,47,48,53,54,55,56,59,60,63,64
a2*b4->3,4,19,20,27,29,35,36,39,40,45,46,51,52,62 a1*b5->7,8,15,16,23,24
a0*b6->2).
MATHEMATICA
b = {1, 9, 10, 13, 14, 43, 44, 5, 6, 25, 26, 28, 30, 33, 34, 37, 38, 49,
50, 57, 58, 61, 11, 12, 17, 18, 21, 22, 31, 32, 41, 42, 47, 48, 53, 54,
55, 56, 59, 60, 63, 64, 3, 4, 19, 20, 27, 29, 35, 36, 39, 40, 45, 46,
51, 52, 62, 7, 8, 15, 16, 23, 24, 2} Sort[b] Length[b] ListPlot[b,
PlotJoined -> True]
CROSSREFS
Adjacent sequences: A116591
<http://www.research.att.com/%7Enjas/sequences/A116591> A116592
<http://www.research.att.com/%7Enjas/sequences/A116592> A116593
<http://www.research.att.com/%7Enjas/sequences/A116593> this_sequence
A116595 <http://www.research.att.com/%7Enjas/sequences/A116595> A116596
<http://www.research.att.com/%7Enjas/sequences/A116596> A116597
<http://www.research.att.com/%7Enjas/sequences/A116597>
Sequence in context: A078459
<http://www.research.att.com/%7Enjas/sequences/A078459> A078390
<http://www.research.att.com/%7Enjas/sequences/A078390> A037408
<http://www.research.att.com/%7Enjas/sequences/A037408> this_sequence
A050593 <http://www.research.att.com/%7Enjas/sequences/A050593> A110095
<http://www.research.att.com/%7Enjas/sequences/A110095> A061445
<http://www.research.att.com/%7Enjas/sequences/A061445>
KEYWORD
nonn,uned,probation,obsc
AUTHOR
Roger *Bagula* (rlbagulatftn(AT)yahoo.com), Mar 27 2006
A Microsoft application doesn't do me a lot of good on an old Mac, here.
Try giving us an idea of how your program works.
I've done work on text based fractals as in fractal
poetry patterns, too.
The word Zipf's law plots of word frequency rankings
are what inspired me and that in many cultures
the oral tradition is in rhyming poetry that has a definite
kind of word emphasis.
Roger Bagula |
|
|
| Back to top |
|
| |
|
Page 1 of 1
All times are GMT - 5 Hours
The time now is Thu Oct 16, 2008 4:07 pm
|
|