log

anonymous@undisclosed.example.com (Anonymous) — Mon, 27 Nov 2017 16:48:01 +0000

@@ -3,8 +3,20 @@
  
  ===== 2017 =====
  
  ==== November ====
+ 
+ === 2017-11-02 ===
+   * Not much to report code-wise. I've mostly just been running experiments and working on my paper.
+   * Tonight I'm probably going to actually make one tiny change to my code -- I need to so I can get a higher resolution on one of my independent variables. Something interesting might be happening very close to zero.
+ 
+ === 2017-11-02 ===
+   * Script that runs through various parameters and calls a given number of mfms runs with each value now works
+   * Unsurprisingly, the super-basic experiment I had set up does not produce a U-shaped curve
+   * The scripts for gathering data are fairly flexible -- I should be able to also use them for counting individual occurrences in the log files, too.
+   * That might be useful for quantifying something about how swarms work, because I'm still interested in building mobile swarms of beacons.
+   * Now that my data-gathering tooling is working I'll be getting back to aggressively expanding what my actual project code can do, and hopefully soon find a U-shaped curve somewhere. I had kind of put my actual ULAM code by the wayside to work on this stuff, because I wanted to have thorough data for Monday's presentation, even if it was of something really boring.
+   * I should be able to iterate and quantify at a fairly fast pace now, since I can use these scripts to get quantitative data out of some thousands of AEPS/minute.
  
  === 2017-11-01 ===
    * Parsing log files to make CSV data files of AEPS to completion from a series of experiments ... [drumroll] ... works
      * [this is me high-fiving a million angels]

project

anonymous@undisclosed.example.com (Anonymous) — Thu, 14 Sep 2017 17:44:35 +0000

@@ -1,9 +1,28 @@
  ====== Project Ideas ======
+ [[people:joby_elliott|Joby Elliott]]
  
- I'm still somewhat interested in consensus-building, but I kind of wonder if it should even be all that complex in a lot of cases. Certainly this is a big topic to bite into, and if I were to explore it I would need to find a way to focus a little.
+ ===== Deterministic outcomes from non-deterministic substrate =====
+ 
+ Very early in the semester I built (and subsequently failed to save anywhere) an element that did [[https://en.wikipedia.org/wiki/Abelian_sandpile_model|Abelian sandpile models]], and in my experience it actually did produce deterministic outcomes. Which is sort of astonishing for the MFM, but was what I expected. This is actually one of the fascinating properties of this particular cellular automaton -- that its outcome is not dependent on its update order.
+ 
+ This idea is pretty abstract, and would require a review of literature that might be over my head, but I'm really extremely interested in exploring what other ways simple rules might be able to produce deterministic output despite non-deterministic update orders.
+ 
+ I was also considering exploring uses for the fact that sandpiles tend to gravitate toward critical states. It might be possible to use sandpile "grains" as messaging packets to create a messaging system that passes data in a way that will cover a significant portion of a pile, but is also guaranteed to terminate.
+ 
+ At the very least I'll probably rebuild that sandpile element and collect some data verifying that it is in fact deterministic. Just for fun.
+ 
+ ===== Bonds =====
  
  At this point I'm so taken with the concept of bonds that I'm actually leaning toward wanting to just do an implementation of that. I've got some ideas for how to use them for semi-permeable membranes, too.
+ 
+ ===== Resource/destination locating beacon grid =====
  
  As a less big-monster-central-questiong-of-the-entire-paradigm project than "consensus," I have an idea for combining the wavefront/burn idea with the ant/nest concept with something like pheromones but which builds a sparse grid of copies of itself. Make the grid self-repairing, and use propagating/burning signals to map the gradient both back to the nest and to ants that have located things they are looking for. See if a solid resource-gathering behavior can be built that way, even inside a maze or around obstacles.
+ 
+ ===== Consensus building =====
+ 
+ I'm still somewhat interested in consensusbuilding, but I kind of wonder if it should even be all that complex in a lot of cases. Certainly this is a big topic to bite into, and if I were to explore it I would need to find a way to focus a little.
+ 
+ ===== Getting data in and out =====
  
  Another more practical-applications sort of idea I have in my head is trying to think up a way of getting data in and out of an MFM in a robust fashion. This one probably also falls in the "too big" category though, unless I have a more specific idea before next week.

Robust-first Computing Wiki - people:joby_elliott

log

project