thought experiments

vha3 · Oct 7, 2024 · 1b7f3ee · 1b7f3ee
1 parent df320d3
commit 1b7f3ee
Show file tree

Hide file tree

Showing 14 changed files with 24 additions and 2 deletions.
diff --git a/.DS_Store b/.DS_Store
diff --git a/5160/.DS_Store b/5160/.DS_Store
diff --git a/Collaborations/.DS_Store b/Collaborations/.DS_Store
diff --git a/DE1/.DS_Store b/DE1/.DS_Store
diff --git a/Essays/Black_holes.pdf b/Essays/Black_holes.pdf
diff --git a/Essays/Characters_in_a_story.pdf b/Essays/Characters_in_a_story.pdf
diff --git a/Essays/Earth_as_computer.pdf b/Essays/Earth_as_computer.pdf
diff --git a/Math/.DS_Store b/Math/.DS_Store
diff --git a/Monarch/.DS_Store b/Monarch/.DS_Store
diff --git a/Pico/.DS_Store b/Pico/.DS_Store
diff --git a/Pico/Galton/.ipynb_checkpoints/Galton-checkpoint.ipynb b/Pico/Galton/.ipynb_checkpoints/Galton-checkpoint.ipynb
@@ -64,7 +64,7 @@
     "\n",
     "**Math and physics background**\n",
     "- The statistics of an idealized Galton Board.\n",
-    "- Modeling collision physics for the digital Galton Board\n",
+    "- [**The physics of colliding balls, with coefficient of restitution**](./Collisions.html): Describes the physics that you will be implementing. Pay particular attention to \"Bouncing off a round peg, with coefficient of restitution.\"\n",
     "- [**Alpha max plus beta min algorithm**](https://en.wikipedia.org/wiki/Alpha_max_plus_beta_min_algorithm): An efficient algorithm for computing quick-and-dirty root sum of squares.\n",
     "\n",
     "**Engineering background**\n",

diff --git a/Pico/Galton/Galton.ipynb b/Pico/Galton/Galton.ipynb
@@ -64,7 +64,7 @@
     "\n",
     "**Math and physics background**\n",
     "- The statistics of an idealized Galton Board.\n",
-    "- Modeling collision physics for the digital Galton Board\n",
+    "- [**The physics of colliding balls, with coefficient of restitution**](./Collisions.html): Describes the physics that you will be implementing. Pay particular attention to \"Bouncing off a round peg, with coefficient of restitution.\"\n",
     "- [**Alpha max plus beta min algorithm**](https://en.wikipedia.org/wiki/Alpha_max_plus_beta_min_algorithm): An efficient algorithm for computing quick-and-dirty root sum of squares.\n",
     "\n",
     "**Engineering background**\n",

diff --git a/Strings/.DS_Store b/Strings/.DS_Store
diff --git a/index.html b/index.html
@@ -13100,6 +13100,7 @@ <h4 id="Lecturer-of-Electrical-Engineering,-Cornell-University-([email protected]
 <li><a href="#Expository-webpages">Expository webpages</a></li>
 <li><a href="#Courses,-lectures,-and-talks">Courses, lectures, and talks</a></li>
 <li><a href="#Academic-papers">Academic papers</a></li>
+<li><a href="#Thought-experiments">Thought experiments</a></li>
 <li><a href="#Professional-stuff-and-external-links">Professional stuff and external links</a></li>
 </ul>
 </blockquote>
@@ -13487,6 +13488,27 @@ <h2 id="Academic-papers">Academic papers<a class="anchor-link" href="#Academic-p
 <div class="text_cell_render border-box-sizing rendered_html">
 <hr>
 
+</div>
+</div>
+</div>
+<div class="cell border-box-sizing text_cell rendered"><div class="prompt input_prompt">
+</div><div class="inner_cell">
+<div class="text_cell_render border-box-sizing rendered_html">
+<h2 id="Thought-experiments">Thought experiments<a class="anchor-link" href="#Thought-experiments">&#182;</a></h2><p>Thinking about the programs that people generate, and vice versa. These are playful, not rigorous.</p>
+<ol>
+<li><a href="./Essays/Characters_in_a_story.pdf">Can characters in a story figure out that they're in a story?</a></li>
+<li><a href="./Essays/Black_holes.pdf">Are black holes symptomatic of a simulation, or of a bandwidth-limit on the universe?</a></li>
+<li><a href="./Essays/Earth_as_computer.pdf">What does a future in which natural computing has taken hold look like?</a></li>
+</ol>
+
+</div>
+</div>
+</div>
+<div class="cell border-box-sizing text_cell rendered"><div class="prompt input_prompt">
+</div><div class="inner_cell">
+<div class="text_cell_render border-box-sizing rendered_html">
+<hr>
+
 </div>
 </div>
 </div>