coarse graining

classic Classic list List threaded Threaded
1 message Options
Reply | Threaded
Open this post in threaded view
|

coarse graining

Nick Thompson
Frank, 'n all.

I feel like I have been waiting to read something like this for years.  

A kind of computational time-lapse photography.  

Can we discuss it, first thing, at FRIAM.

Does anybody UNDERSTAND it.

Nick

Nicholas S. Thompson
Professor of Psychology and Ethology
Clark University
[hidden email]
http://home.earthlink.net/~nickthompson/
 [hidden email]


> [Original Message]
> From: <[hidden email]>
> To: <[hidden email]>
> Date: 3/3/2005 9:00:22 AM
> Subject: Friam Digest, Vol 21, Issue 3
>
> Send Friam mailing list submissions to
> [hidden email]
>
> To subscribe or unsubscribe via the World Wide Web, visit
> http://redfish.com/mailman/listinfo/friam_redfish.com
> or, via email, send a message with subject or body 'help' to
> [hidden email]
>
> You can reach the person managing the list at
> [hidden email]
>
> When replying, please edit your Subject line so it is more specific
> than "Re: Contents of Friam digest..."
>
>
> Today's Topics:
>
>    1. Too Much Information (Frank Wimberly)
>
>
> ----------------------------------------------------------------------
>
> Message: 1
> Date: Wed, 2 Mar 2005 14:47:22 -0500
> From: "Frank Wimberly" <[hidden email]>
> Subject: [FRIAM] Too Much Information
> To: <[hidden email]>
> Message-ID: <008101c51f60$a79a35b0$0300a8c0@FRANKNOTEBOOK>
> Content-Type: text/plain; charset="iso-8859-1"
>
> >From the ACM Technews mailing:
>
> • "Too Much Information"
> New Scientist (02/26/05) Vol. 185, No. 2488, P. 32; Buchanan, Mark
> Earthquakes, ecosystems, economies, and other inherently complex systems
and
> events long regarded to be mathematically irreducible could be more
> measurable then previously thought, according to research into cellular
> automata, which are computer programs that can form complex patterns by
> following simple rules. University of Illinois at Urbana-Champaign
> researchers Nigel Goldenfeld and Navot Israeli applied pattern analysis
via
> "coarse-grained" models to cellular automata. Such analysis, in which the
> models concentrate only on the most relevant details of the
pattern-forming
> process, has demonstrated that similar logic principles apply to
completely
> different situations. Goldenfeld and Israeli established that in 240 out
of
> 256 cellular automata outlined by mathematician Stephen Wolfram, rules
that

> generated relatively simple and predictable patterns roughly mirrored the
> behavior of rules that led to computationally irreducible patterns. This
> rule also held for automata notorious for their computational
> irreducibility. Meanwhile, Santa Fe Institute physicist Jim Crutchfield
> believes connections between the past and future for virtually any system
> could be predicted with a "computational mechanics" approach he has
> developed. He reasons that the various histories of a system can be sorted
> into classes, so that the same outcome applies for all histories in each
> class. This means that many details of the underlying system may be
> inconsequential, so that an approximate description much like Goldenfeld
and

> Israel's coarse-grained models can be organized and used to make
> predictions. Crutchfield and Goldenfeld agree that coarse-graining could
> help tackle deep scientific problems.
>
>
> ---
> Frank C. Wimberly       140 Calle Ojo Feliz       Santa Fe, NM 87505
> Phone:   505 995-8715 or 505 670-9918 (cell)
> [hidden email] or [hidden email]
>  
>
>
>
>
>
> ------------------------------
>
> _______________________________________________
> Friam mailing list
> [hidden email]
> http://redfish.com/mailman/listinfo/friam_redfish.com
>
>
> End of Friam Digest, Vol 21, Issue 3
> ************************************