We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.

Talk:WhatInTheWorld

From Esolang
Jump to navigation Jump to search

Joke?

What so joke in this language? Looks serious enough for me. I believe that with memory size limit removed and unbounded registers it would become Turing Complete. --Blashyrkh (talk) 09:56, 15 May 2026 (UTC)

Few clarifications needed

  1. Are registers initially zero?
  2. Are memory cells initially zero?
  3. Are negative numbers allowed?
  4. 14,15,16: what is written to a register on EOF? 0? -1? 255? 256? No change?
  5. Ambiguity of 20, 21, 22: when matching "opening/closing bracket" is being searched, are only even (zero-based) positions are considered? 0213 - is it "21 opcode" in the middle or not?
  6. When matching opening/closing bracket is being searched, is the nearest one taken or the matching one?

--Blashyrkh (talk) 10:21, 15 May 2026 (UTC)

Base 5

Since you have exactly 25 opcodes, switching to base 5 would utilize all 2-digit base-5 numbers as opcodes. --Blashyrkh (talk) 10:31, 15 May 2026 (UTC)