From 49b1b2d809dcfc7d26501c24137d50c591e2ce23 Mon Sep 17 00:00:00 2001 From: Jean Sirmai Date: Tue, 30 Mar 2021 08:08:39 +0000 Subject: [PATCH] Update theory.md --- theory.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/theory.md b/theory.md index d86c37b..33f5a1e 100644 --- a/theory.md +++ b/theory.md @@ -41,7 +41,7 @@ Speed depend on the average depth of the transitions tree and on number of neutr If some possible situations are not described by a rule, there are neutral branches. Then, exploring the local space may not lead to any change. The more neutral branches, the longer the exploration of the tree. This is because the nodes that have a neutral branch may need to be explored several times, if the exploration of their non-neutral branches fails. Speed depends lesser on the size of the area covered by the set of transition rules. This size mainy limits the number of possible parallel processes in the space. -Granularity is not set once for all. It is possible to simultaneously manage both near and distant objects or parts of objects by combining arrows of short and long range. These allow to detail local areas of interest within a situation grossly described and to associate various levels of granularity within an approximation of a continuous space. +Granularity is not set once for all. It is possible to simultaneously manage both near and distant objects or parts of objects by combining arrows of short and long range. These allow to detail local areas of interest within a situation grossly described and to associate various levels of granularity up to an approximation of a continuous space. Using arrows, it is also possible to write in the space specific tags that can be associated to any objects or situations. This technique allows to keep a clear separation between static and dynamic information. This separation is the condition of an unique rules design which allows, in turn, their automatic rewriting. Addition of automata