commit a0f615c413e2f907e46b54e7cad6177a7941a660
parent c4a47044e03729a7f2d726a993fe588f86f4792e
Author: Antoine Amarilli <a3nm@a3nm.net>
Date: Thu, 24 Jul 2025 14:48:02 +0200
commit with codex
Diffstat:
2 files changed, 3 insertions(+), 1 deletion(-)
diff --git a/computational_complexity b/computational_complexity
@@ -40,7 +40,7 @@
## Results
- [ladners_theorem]
-- [complexity_zoo]
+- [Rice's_theorem]
## Techniques
@@ -52,6 +52,7 @@
- [descriptive_complexity]
- [lower_bounds]
- [klees_measure_problem]
+- [complexity_zoo]
Up: [theoretical_computer_science], [complexity]
diff --git a/theorem b/theorem
@@ -28,6 +28,7 @@ A [result] in [mathematics], recognized as challenging to prove
- [Parikh's_theorem]
- [Prime_number_theorem]
- [Ramsey_theorem]
+- [Rice's_theorem]
- [Roths_theorem]
- [Savitch's_theorem]
- [Schnyder's_theorem]
