Differences

This shows you the differences between two versions of the page.

--- concepts:neutral_dynamics [2014/12/28 05:10] – [Robust-first computing concepts: Neutral Dynamics] ackley
+++ concepts:neutral_dynamics [2014/12/28 05:43] (current) – [The neutral dynamics of classical computing] ackley
@@ Line 25: / Line 25: @@
 But such fixed-point neutral dynamics is far from the only possible case.  If it is our will to learn the time of day, for example, and we happen upon a person that seems likely to know, we can run the 'Excuse me, have you got the time?' program upon that person, and quite likely achieve our goal.  Whatever that person was up to before we exerted our will upon them --- crossing the street, buying an apple, daydreaming until the bus comes --- it was **something**.
-And in any case, classical computers with static neutral dynamics are getting harder to find.  When you power up a typical new machine today, it //tries to program you//.  It tries to get you going answering questions, giving your name and this and that and god forbid your credit card number, and like a pushy house guest it immediately wants your wifi password to start sucking great gobs of who knows what through your internet connection.  Programmers often have to do quite a bit of work to gain the upper hand in such who's-programming-whom shoving matches.
+And in any case, classical computers with static neutral dynamics are getting harder to find.  When you power up a typical new machine today, it //tries to program you//.  It tries to get you going answering questions, giving your name and this and that and god forbid your credit card number, and like a pushy house guest it immediately wants your wifi password to start sucking great gobs of who knows what through your internet connection.  Programmers often have to do quite a bit of work to gain the upper hand in such who's-programming-whom wrestling matches.
 ===== Neutral dynamics in the Movable Feast Machine =====