Timeline for Are compact topological $n$-manifolds recursively enumerable?
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 24, 2015 at 18:10 | comment | added | Eric S. | HJRW sums the situation up well. If I were to propose a specific model in my question, I run the risk of getting answers about the infeasibility of that model. What I really want is either positive evidence, or a broader discussion of why no feasible model or definition is likely to exist. | |
| Oct 24, 2015 at 16:49 | comment | added | Bjørn Kjos-Hanssen | If you think about the classification of 2-manifolds (spheres and Klein bottles with varying numbers of handles), it is definitely computable. | |
| Oct 24, 2015 at 15:57 | comment | added | HJRW | It seems to me that the whole point of the question is that the OP doesn't presume to know what sort of formalisation might work. Sure, that makes the question vague, but it's still a reasonable mathematical question. Often in mathematics, we know that some definition doesn't go the job we want, and wonder if there's another one which does. | |
| Oct 24, 2015 at 15:55 | history | undeleted | Christian Remling | ||
| Oct 24, 2015 at 15:54 | history | deleted | Christian Remling | via Vote | |
| Oct 24, 2015 at 15:51 | history | undeleted | Christian Remling | ||
| Oct 24, 2015 at 15:50 | history | edited | Christian Remling | CC BY-SA 3.0 |
added 181 characters in body
|
| Oct 24, 2015 at 15:46 | history | deleted | Christian Remling | via Vote | |
| Oct 24, 2015 at 15:43 | history | answered | Christian Remling | CC BY-SA 3.0 |