Talk:CV(N)(C)
To me, it seems that this trivially reduces to a two counter machine. It is therefore Turing complete. If so, it should be changed to Turing Complete instead of class unknown. What am I missing?
Here is an attempted sketch of a proof-by-translation:
Preamble: /m/
INC 0 -> /i/
INC 1 -> /nŋimɲ/
DEC 0 -> /ə/
DEC 1 -> /nŋəmɲ/
WHILE 0 ... END -> /ɰ/ (convert ...) /ʋ/
Your proof by translation doesn't work as the code must follow the syllable structure CV(N)(C) said in Syntax.
However, there exists a different proof by translation using brainfuck with 3 unbounded unsigned cells. The program must start with funfun to initialize it.
| Brainfuck | CV(N)(C) |
|---|---|
| + | fi |
| - | fə |
| > | funfuŋ |
| < | fumfuɲ |
| [ | ɰ̊u |
| ] | ʋu |
Note that the io instructions aren't there because they aren't needed and 4/6 of the instructions use output commands as NOPs. Gapples2 (talk) 14:32, 8 June 2022 (UTC)