For any given language, what is the smallest amount of unique characters for your language to be Turing-Complete?
For any language of your choice, find the smallest subset of characters that allows your language to be Turing-Complete. You may reuse your set of characters as many times as you want.
+<>(assumes a wrapping cell size)
()+1cehrx(made from scripts like
This challenge is scored in characters, not bytes. For example, The scores for the examples are 6, 5, and 9.
This challenge differentiates from others in the sense that you only your language to be Turing-Complete (not necessarily being able to use every feature of the language.)
Although you can, please do not post answers without reducing the characters used. Example: Brainfuck with 8 characters (since every other character is a comment by default.)
You MUST provide at least a brief explanation as to why your subset is Turing-Complete.