1 / 11

Self-Modification Example

Self-Modification Example . Self-modification Example. A simple example: X= SUM(List). Self-modification Example. X. A%. =. +. List Link. Initially, the list variable, A%, has no value. Self-modification Example. B. X. A%. A%. C. =. +. List Link. List Link. =. D.

kioshi
Download Presentation

Self-Modification Example

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Self-Modification Example

  2. Self-modification Example A simple example: X= SUM(List)

  3. Self-modification Example X A% = + List Link Initially, the list variable, A%, has no value

  4. Self-modification Example B X A% A% C = + List Link List Link = D The list variable, A%, obtains a value – a list that contains 3 numeric variables, { B, C, D }. Their values are initially unknown.

  5. A% A% A% List Link List Link List Link Self-modification Example B=9 B X X=5 + = + C C=3 D D=-7 LISTLINK detaches itself and links the variables directly to the PLUS B, C and X obtain values, which propagate into the PLUS. As a result, D obtains a value

  6. A% A% List Link List Link Self-modification Example B=9 X=5 = + C=3 D=-7 A%, the list variable, loses its value.

  7. B=9 B=9 B=9 B=9 C=3 C=3 C=3 C=3 D D D D=-7 A% A% A% A% List Link List Link List Link List Link Self-modification Example X=5 = + + A%, the list variable, loses its value. LISTLINK detaches the variables from the PLUS (note that only D loses its value) and reattaches itself.

  8. Structural Backtrack If a system can change its structure, it also needs some way to hypothesise about a change in structure, make the change, then possibly undo it. Of course, other structural changes may be occurring due to propagation - the two effects need to be interleaved. This is structural backtrack - old information can be overlaid as though the changes never happened.

  9. What Does It Show • This simple example manages to show several things: • The network changed its topology in response to internal propagation • The network “grew” new connections to hold the states needed to represent implicit information • Growth is possible because the network is in a “soup” of (relatively) limitless resource • Growth is reversible if the states that caused it change

  10. A More Complex Example - Free Text A closer look at the finishDate of the Occupy relation. The date value of the ImpliedOne is linked both to an “and” objectgroup comprising August 31, 2005, and the date which is the StartDate of the IS relation of “Tenant’s Work is Substantially complete”. The OBJECTTEST operator created a MINoperator linking the three date values. This is self-modification run riot, where the starting structure (about 100k elements) builds structure (about 500k elements) by reading text.

  11. Self-Modifying Machine A self-modifying machine - weaving a structure from words, with the new structure seamlessly merging with existing structure

More Related