The punchline at the end is worth calling out: Turing Equivalence applies at fir...

tel on Jan 11, 2020 | parent | context | favorite | on: Sometimes all functions are continuous (2006)

The punchline at the end is worth calling out: Turing Equivalence applies at first-order computations like `Nat -> Nat`, but fails at higher-order computation like `(Nat -> Nat) -> {0, 1}`.