Talk:Sitelen ilo

Can somebody please finish the categorisation and all that for me? Thanks. Jan Gamecuber (talk) 00:07, 20 April 2022 (UTC)

Turing Completeness

BCT compiler (where starting data is 1)

 
      Program li kulupu [] namako Put each bit as it's own entry. 
      Data li kulupu [wan]
      InstructionPointer li nanpa 0
      sin lawaAla pi list
          retVal li kulupu []
          counter li nanpa wan
          ma ni li ForLoop
          retVal[suli pi retVal] li nanpa list[counter]
          counter li nanpa (counter en wan)
          ((suli pi (list weka wan))la counter li lili anu sama) la ni
              tawa ForLoop
          sitelen retVal
      sin Modulus pi input, base
          retVal li nanpa input
          ma ni li FnStart
          (base la retVal li mute anu sama) la ni
               retVal li nanpa (retVal weka base)
               tawa FnStart
          sitelen retVal
      ma ni li PrgLoopStart
      ([] la Data li sama) la ni
          tawa End
      (InstructionPointer la (suli pi Program) li lili anu sama) la ni
          InstructionPointer li nanpa (pali Modulus pi InstructionPointer, (suli pi Program))
      (Program[InstructionPointer] la ala li sama) la ni
          pali lawaAla pi Data
      (Program[InstructionPointer] la ala li sama) la ni
          (Data[0] la wan li sama) la ni
              Data[suli pi Data] li nanpa Program[pali Modulo pi (InstructionPointer en wan), suli pi Program]
           InstructionPointer li nanpa (InstructionPointer en wan)
      InstructionPointer li nanpa (InstructionPointer en wan)
      tawa PrgLoopStart
      ma ni li End 

This proves turing completeness, right? Jan Gamecuber (talk) 22:15, 21 April 2022 (UTC)