Define a "computational cardinal" to be an equivalence class (with respect to recursive isomorphism) of subsets of natural numbers.
Computational cardinals are partially ordered: [A] ≤ [B] iff A is one-one reducible to B.
8:53 AM - 26 Sep 2016
0 replies
0 retweets
1 like
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.