Timeline for Does "productive = dimension $\omega$" for computable structures?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 29, 2020 at 19:51 | comment | added | Noah Schweber | I've asked my comment as a follow-up question. | |
| Nov 29, 2020 at 19:19 | vote | accept | Noah Schweber | ||
| Nov 29, 2020 at 6:44 | comment | added | Noah Schweber | That's gorgeous, thanks! (I'll accept it when I've had time to read it when I'm not about to sleep.) Incidentally, this raises a followup question: is there a computable-dimension-$\omega$ structure with a computable enumeration of representatives of its computable isomorphism types (that is, a computable sequence $(n_i)_{i\in\omega}$ such that each computable copy is computably isomorphic to a structure with index $n_i$ for some $i$)? Such a structure would also be non-productive, but very differently from your example. | |
| Nov 29, 2020 at 6:32 | history | answered | Dan Turetsky | CC BY-SA 4.0 |