From 80d9011dbf828f4007b39ba09d7f328fd12ab94f Mon Sep 17 00:00:00 2001
From: Fadi Shawki <fadi.shawki@orbitmines.com>
Date: Fri, 7 Jun 2024 13:56:35 +0200
Subject: [PATCH] Math

---
 .../src/routes/papers/2024.AUniversalLanguage.tsx          | 7 +++++++
 1 file changed, 7 insertions(+)

diff --git a/orbitmines.com/src/routes/papers/2024.AUniversalLanguage.tsx b/orbitmines.com/src/routes/papers/2024.AUniversalLanguage.tsx
index 7195958..05112fb 100644
--- a/orbitmines.com/src/routes/papers/2024.AUniversalLanguage.tsx
+++ b/orbitmines.com/src/routes/papers/2024.AUniversalLanguage.tsx
@@ -398,6 +398,13 @@ const AUniversalLanguage = () => {
           </Block>
 
 
+          <TODO>
+            I suspect that all these moduli-type questions become computable problems. And it should become obvious that all these moduli-type questions are only answerable if you already have access to some other moduli space.
+          </TODO>
+          <TODO>
+            And you can probably setup ways where you can switch between discrete/infinitary stuctures at will. - Of course this doesn't mean it's easily tractable. But more that these problems become computable searchspaces.
+          </TODO>
+
         </Section>
       </Arc>