Define a "computational cardinal" to be an equivalence class (with respect to recursive isomorphism) of subsets of natural numbers.
-
[A]+[B] = [{2n | n∈A} ∪ {2n+1 | n∈B}].
reminds me a little bit of Cantor's integer pairing function: https://en.wikipedia.org/wiki/Pairing_function#Cantor_pairing_function … but with fewer desirable properties
-
-
It's usually called the join of A and B. See https://en.wikipedia.org/wiki/Turing_degree#Turing_equivalence …
-
Hi Are there any solving book for exercises in universal algebra?
- 2 more replies
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.