Activity for celtschk
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Comment | Post #279854 |
BTW, your algorithm produces strings without spaces, but your examples contain spaces after the commas. This raises the question of (a) whether those spaces should be generated, and (b) whether the code should handle such spaces and/or the absence of them in the input. (more) |
— | over 3 years ago |
| Comment | Post #279854 |
Since all strings are of finite length, only hereditary finite sets can be represented as such strings anyway. And even if you consider strings of countably infinite length, you obviously cannot represent all sets as such strings. I think a better strategy would be to define the “set strings” by thei... (more) |
— | over 3 years ago |
| Comment | Post #279854 |
I haven't completely gone through your algorithm, but I suspect what you define is the [Ackermann bijection](https://en.wikipedia.org/wiki/Hereditarily_finite_set#Ackermann%27s_bijection) between the natural numbers and the hereditary finite sets. (more) |
— | over 3 years ago |
| Comment | Post #279854 |
Your depth is called rank (see [here](https://math.stackexchange.com/a/458305/34930)). Note that the definition you give only works for finite sets, as in infinite sets there may not be a maximum, see the link for a definition that always works. Also, what you call “finite” is properly called heredit... (more) |
— | over 3 years ago |
| Comment | Post #279722 |
This is not kolmogorov-complexity, as it takes input. (more) |
— | over 3 years ago |
| Comment | Post #279791 |
An explanation would be nice. (more) |
— | over 3 years ago |
| Comment | Post #279253 |
@Razetime: You should probably add that as a test case, as several currently posted solutions fail in this case. (more) |
— | over 3 years ago |
| Comment | Post #279253 |
What should be the result for t1=t2=0? (more) |
— | over 3 years ago |
| Comment | Post #279425 |
You can save 7 bytes by replacing `'SIGSEGV'` with `11` (the signal number of SIGSEGV). (more) |
— | over 3 years ago |
| Comment | Post #279141 |
Is it intentional that this community is not listed on the [main page?](https://codidact.com/) (I already commented about that on the proposal post, but I guess that was the wrong place for that comment) (more) |
— | over 3 years ago |
| Comment | Post #279365 |
I'm pretty sure U+0020 is the space, and U+000A is the newline. BTW, what *exactly* does "must not produce an error from start to finish" mean? In particular, do compiler warnings count as errors in this context? (more) |
— | over 3 years ago |
- ← Previous
- 1
- 2
- 3
- Next →