Define a "computational cardinal" to be an equivalence class (with respect to recursive isomorphism) of subsets of natural numbers.
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?
-
We weren't discussing universal algebra above, but https://math.berkeley.edu/~gbergman/245/3.3.pdf … contains universal algebra exercises.
-
Thanks!
End of conversation
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.