3 comments

  • MelonUsk4 days ago
    Their website: <a href="https:&#x2F;&#x2F;treecalcul.us" rel="nofollow">https:&#x2F;&#x2F;treecalcul.us</a><p>By the way, unary and binary trees are probably the most minimal way to generate the whole computational universe
    • xelxebar45 minutes ago
      Surprisingly, there are combinatorial systems with just a single combinator[0]. Also, NAND along with a single axiom[0] can reproduce all of propositional calculus. By Curry-Howard-Labek, these are related facts and suggest that a universal tree likely exists in the tree calculus.<p>[0]:<a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Iota_and_Jot" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Iota_and_Jot</a><p>[1]:<a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Nicod&#x27;s_axiom" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;Nicod&#x27;s_axiom</a>
    • mathisfun12311 minutes ago
      &gt; unary<p>wtf is a unary tree? isn&#x27;t that a list?
  • peter_d_sherman55 minutes ago
    &gt;&quot;<i>Tree calculus</i> is a minimal, modular, Turing-complete and reflective calculus.&quot;<p>This makes it a candidate for the foundation of all of Mathematics...<p>Other candidates in this space include such things as <i>Category Theory</i> (everything reduces down to a single operation called a &#x27;composition&#x27;), <i>Lambda Calculus</i> (everything reduces down to function application), <i>Formal Rewriting Systems</i> (aka Symbol Substitution &#x2F; Post Canonical System &#x2F; Markov Algorithm -- everything reduces to a single operation: string rewriting, matching a pattern of symbols and replacing it with another. Turing Machines, for example, exist within this space...), <i>Homotopy Type Theory</i> (aka <i>HoTT</i>: Paths as Transformations, statements of equality (a = b) are not static truth values; they are paths (or continuous transformations) living in a higher-dimensional space. Logical proofs, algebraic manipulations, and geometric deformations are all unified under the concept of &quot;path induction.&quot; Proving that two mathematical structures are equivalent is equivalent to finding a continuous path of transformation between them.&quot;)<p>That&#x27;s some of them, others include such things as <i>Turing Complete Finite Automata</i>, i.e., Rule 110, etc., etc.)<p>Anyway, excellent link, and we welcome <i>Tree Calculus</i> to this list!<p>Related: <a href="https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;One-instruction_set_computer" rel="nofollow">https:&#x2F;&#x2F;en.wikipedia.org&#x2F;wiki&#x2F;One-instruction_set_computer</a>
    • steego8 minutes ago
      Great notes!<p>I think it’s also worth noting that Barry Jay has a particularly strong vantage point for unearthing this particular foundational candidate. First, his advisor was Joachim Lambek, who’s responsible for adding Category Theory in the Curry-Howard-Lambek correspondence.<p>If one looks at Barry’s body of work over his lifetime, it’s no surprise it would culminate into an elegantly beautiful system capable of self-reflection.<p>I think his 2025 PEPM paper did a great job explaining the ideas to a regular programmer &#x2F; wannabe academic like myself: <a href="https:&#x2F;&#x2F;github.com&#x2F;barry-jay-personal&#x2F;typed_tree_calculus&#x2F;blob&#x2F;main&#x2F;typed_program_analysis.pdf" rel="nofollow">https:&#x2F;&#x2F;github.com&#x2F;barry-jay-personal&#x2F;typed_tree_calculus&#x2F;bl...</a>
  • Suhinnall272 hours ago
    [flagged]