throwaway982736

3 ms·

1. 1.▲
   by throwaway982736 9y ago

   Does this help?: https://medium.com/@IsaacSimpson/urbit-and-the-not-so-dark-f...
2. 2.▲
   Galen Wolfe-Pauly on Internet Culture and Urbit's Future(youtube.com)

   1 points by throwaway982736 9y ago|0 comments
3. 3.▲
   by throwaway982736 9y ago

   "So it's not true that Tlon can't just say $user's compute node is hereby expelled?" Correct, this is untrue.
4. 4.▲
   by throwaway982736 10y ago

   Representing "Con(T)" in a formal language with the Peano Axioms isn't all that long, relatively speaking. No diagonalization is needed. It's basically: ~(Ex)Proof(x, ~0=0) I.e., "There doesn't exist a proof