From ceb8e64a35f3ac50c5b87cd977e9c210de9585f6 Mon Sep 17 00:00:00 2001 From: Sergiu Ivanov Date: Tue, 8 Aug 2023 16:50:15 +0200 Subject: [PATCH] Promote the TODO of submitting update-graph to Stephen Chang. --- README.org | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.org b/README.org index ade0ad3..50f5d2a 100644 --- a/README.org +++ b/README.org @@ -112,13 +112,13 @@ Racket, which should break a lot of things in [[file:example/example.org][exampl (define-pbf my-pbf (or (and (not :Go) :new-x) (and :Go :old-x))) #+END_SRC +*** TODO Submit =update-graph= to =stchang= *** TODO Implement =monotone?= =monotone?= would verify whether a given Boolean function is monotone according to the definition in the book /Boolean Functions: Theory, Algorithms, and Applications/ by Crama and Hammer. -*** TODO Submit =update-graph= to =stchang= *** DONE Split =networks= into general networks and threshold Boolean networks *** TODO Consider optimizing the algorithms in =networks= and =dynamics= *** TODO Implement the BN \to RS conversion