diff options
| author | user <user@localhost.localdomain> | 2019-08-27 19:16:51 -0400 |
|---|---|---|
| committer | user <user@localhost.localdomain> | 2019-08-27 19:16:51 -0400 |
| commit | d180cc071b592940d4b4cf0283823d29578f1422 (patch) | |
| tree | f00b55fee23982c1fcb885be57e5216c5a1639ec /README.md | |
| parent | c179ae14d5dc6e35031dec3cc7b62e99d6f392be (diff) | |
| download | standingwithresilience-d180cc071b592940d4b4cf0283823d29578f1422.tar.gz standingwithresilience-d180cc071b592940d4b4cf0283823d29578f1422.zip | |
some files to help me jog my memory elsewhere
Diffstat (limited to 'README.md')
| -rw-r--r-- | README.md | 5 |
1 files changed, 2 insertions, 3 deletions
@@ -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 |