Define a "computational cardinal" to be an equivalence class (with respect to recursive isomorphism) of subsets of natural numbers.
-
-
Replying to @ModelOfTheory
Operations defined on computational cardinals:
4 replies 0 retweets 0 likes -
-
Replying to @ModelOfTheory
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
1 reply 0 retweets 0 likes -
Replying to @BagelDaughter
It's usually called the join of A and B. See https://en.wikipedia.org/wiki/Turing_degree#Turing_equivalence …
1 reply 0 retweets 0 likes -
Replying to @ModelOfTheory @BagelDaughter
Hi Are there any solving book for exercises in universal algebra?
1 reply 0 retweets 0 likes
Replying to @OfBeams @BagelDaughter
We weren't discussing universal algebra above, but https://math.berkeley.edu/~gbergman/245/3.3.pdf … contains universal algebra exercises.
8:25 PM - 17 Oct 2016
1 reply
0 retweets
1 like
-
-
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
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.