Timeline for Fewest (distinct) characters for Turing Completeness
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 24, 2017 at 19:11 | comment | added | CalculatorFeline | Also, please add explanation. | |
| Jun 4, 2017 at 1:17 | comment | added | CalculatorFeline | Syms works (and so does 1push4, a language I never published, but with many more than 4 characters (6 (=the number of chars in the language (which are abcd() if you want to know))) | |
| Feb 21, 2017 at 21:43 | comment | added | mbomb007 | Maybe you could look up FlogScript | |
| Feb 21, 2017 at 15:17 | comment | added | user62131 | @seshoumara: Yes, it seems it has all the functionality required. I've added it and credited you. | |
| Feb 21, 2017 at 15:16 | history | edited | user62131 | CC BY-SA 3.0 |
add dc, per @seshoumara
|
| Feb 21, 2017 at 8:16 | comment | added | seshoumara | I was thinking of submitting an answer in dc myself, also a stack based language, but using another method involving more chars than 4. dc has no concatenation operator, but it does have the equivalent ones you mention: [ ] d x. Can dc fit into your list? | |
| Feb 21, 2017 at 7:58 | comment | added | user62131 | @seshoumara: Numbers (and pretty much all other data storage) are implemented very indirectly when using this method. There's something like two or three, maybe even four, levels of abstraction before you get to something recognisable as arithmetic. This sort of thing is common in Turing-completeness proofs of very limited systems like this. | |
| Feb 21, 2017 at 7:52 | comment | added | seshoumara | I understand you can perform stack operations with those, but don't you need at least numbers to populate that stack in order to do mathematical calculations? Or are those done in unary using one of the 4 chars? | |
| Feb 21, 2017 at 6:00 | history | answered | user62131 | CC BY-SA 3.0 |