From d180cc071b592940d4b4cf0283823d29578f1422 Mon Sep 17 00:00:00 2001 From: user Date: Tue, 27 Aug 2019 19:16:51 -0400 Subject: some files to help me jog my memory elsewhere --- README.md | 5 ++--- 1 file changed, 2 insertions(+), 3 deletions(-) (limited to 'README.md') diff --git a/README.md b/README.md index 2f99882..4fe45b2 100644 --- a/README.md +++ b/README.md @@ -10,10 +10,9 @@ and it must be able to refer to itself usefully. 1. Choose a simple algorithm for collecting steps together to perform a task. 2. Choose a simple representation of steps to use for #1. 3. Implement #2 enough to use it to communicate a step to another process. - Once #3 works, the goal now is to efficiently produce a form of #1 as a collection of -processes that can develop themselves, so make sure to reuse your work, and do work that is -reusable, as much as possible. +processes that can develop themselves, using each other as their steps. Make sure to +reuse your work, and do work that is reusable, as much as possible. 4. Choose a simple algorithm for handling if something horrible goes wrong that must never be repeated (trauma). Consider storing a detailed log forever. Consider refusing to -- cgit v1.2.3