๐งต DJNZ OISC?
Anonymous at Thu, 11 Apr 2024 02:07:45 UTC No. 16123490
There is a type of computer called a OISC (One Instruction Set Computer). This computer only gets one instruction.
DJNZ means Decrement, Jump if Not Zero.
I've found some claims that DJNZ is Turing Complete, but have yet to find a proof or any type of example program written using only a DJNZ instruction.
How can DJNZ be shown to be Turing Complete and how can it be used to write programs?
Anonymous at Thu, 11 Apr 2024 05:00:16 UTC No. 16123624
>>16123490
Ask in /mpsg/
Anonymous at Thu, 11 Apr 2024 11:06:58 UTC No. 16123971
>>16123490
Google DJNZ compiler
Anonymous at Thu, 11 Apr 2024 12:01:27 UTC No. 16124032
>>16123624
I guess I could put the question in an image with a maid and post it there. I like the anime girls and advanced Mathematics aesthetic, but the thread needs more maid outfits.
>>16123971
When I use search engine it just tells me about making loops with DJNZ. I see explanations about using DJNZ in instruction sets with other instructions to help make control flow structures, but nothing about how to use only DJNZ to achieve Universal Computation.
How do I represent a number with only DJNZ? Do I have to? Can I assume registers are prepopulated with proper values? How do I compute a proper value for a specific program? How do I k ow how many registers I will need, etc?
Anonymous at Fri, 12 Apr 2024 01:59:44 UTC No. 16124973
>>16124493
Thank you for showing me this. DJNZ has Universal Computation because Subleq has Universal Computation and you can make Subleq with DJNZ.
The program example showing how to make the MOV instruction with DJNZ was nice. Do you know any more code examples?
Anonymous at Fri, 12 Apr 2024 07:51:36 UTC No. 16125239
>>16123490
This is a mathematical problem. These questions belong in the problem solving general /mpsg/