hmmm... yes, good examples of how the logical systems of programmers are implemented using 'heterarchical' physical systems... but does that answer the question of whether abstract systems of logic can be built to be entirely self-referential, while being sustained by 'feeding on' or in other ways 'exploring' the gradients of other systems with which they have no 'logical' connection?
Phil Henshaw ¸¸¸¸.·´ ¯ `·.¸¸¸¸ ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ 680 Ft. Washington Ave NY NY 10040 tel: 212-795-4844 e-mail: [EMAIL PROTECTED] explorations: www.synapse9.com > -----Original Message----- > From: [EMAIL PROTECTED] > [mailto:[EMAIL PROTECTED] On Behalf Of Marcus G. Daniels > Sent: Friday, May 11, 2007 11:57 PM > To: The Friday Morning Applied Complexity Coffee Group > Subject: Re: [FRIAM] Formal Definition of Agent Based Model > > > Phil Henshaw wrote: > > In nature one can often see how it has to do with > > physical parts of systems participating in many independent > systems at > > once. That seems harder for me to imagine for logical > systems. Can it > > be done somehow? > > > > > If you take a typical program and look at it, it's just a string of > characters: opcodes and operands. However, some of these substrings > represent functions that get called from different sorts of > callers on > behalf of a range of higher-level purposes (e.g. a call to allocate > memory or a thread of execution). > > my question > > was simply whether there's a way to design a set of rules that has > > only to do with itself, but relies for it's operation on > rules outside > > it's definitions, beyond it's set of self-references? > With a Unix shared library, for example, even many of the physical > memory parts are shared across independent systems. > Self-referential logic is contained in an assembly, exposing some > symbols, and then different client programs (rules outside it's > definition) drive it via these symbols -- a.k.a user applications. > > > ============================================================ > FRIAM Applied Complexity Group listserv > Meets Fridays 9a-11:30 at cafe at St. John's College > lectures, archives, unsubscribe, maps at http://www.friam.org > > ============================================================ FRIAM Applied Complexity Group listserv Meets Fridays 9a-11:30 at cafe at St. John's College lectures, archives, unsubscribe, maps at http://www.friam.org
