Talk:Bugmaker

Feature ideas

PUT YOUR IDEAS HERE! --TehZ 15:43, 26 August 2010 (UTC)

Proofs of turing-completeness

Do you have a proof? --TehZ 15:43, 26 August 2010 (UTC)

When it says that it prints "DEVELOPERS" when an infinite loop is found, does that mean that there's a chance it won't notice it's an infinite loop? If not, implementing this would require a general solution to the halting problem, and can't be implemented on a turing machine. DanielLC 04:59, 6 December 2010 (UTC)

To me, "if an infinite loop is found" is a fairly weak condition, especially if it's not stated how hard one is required to look for one. --Chris Pressey 16:38, 6 December 2010 (UTC)

Well, at least it should be able to detect a direct infinite loop (as in, unconditioned), but of course, it is impossible to implement a general solution to the halting problem. That's why is said "IF an infinite loop is found". Basically, the interpreter/compiler is required to do SOME searching.

Proposed change for "NOW" lackness

I think that instead of performing lines not ending with "NOW" only at the end of the program, they should be performed at some random time between where they appear in the code and the end of the program. 194.90.37.241 18:35, 12 September 2013 (UTC)

More operators

I think we can add these operators and statements.

   (EXACTLY) _ POWER _
   (EXACTLY) _ MOD _
   (EXACTLY) _ BITWISE AND/OR/XOR _
   (EXACTLY) BITWISE NOT _
   (EXACTLY) SQRT OF _
   (EXACTLY) PI
   (EXACTLY) EULER'S NUMBER
   (EXACTLY) SIN/COS/TAN/ASIN/ACOS/ATAN/LOG10/LN/FLOOR/CEILING/ABS OF _
   DO _ (EXACTLY) _ TIMES
   IF _ IS EVEN/PRIME/INTEGER (FOR SURE) _ ENDIF
   PRINT _ AS ASCII/UNICODE (TO CONSOLE)
   SET (THE VARIABLE NAMED) _ TO (EXACTLY) THE ASCII/UNICODE OF (CHARACTER) _
   SET (ARRAY NAMED) _ TO (ASCII/UNICODE) (STRING) _ // SET ARRAY NAMED H TO ASCII STRING "Hello" sets H to [72, 101, 108, 108, 111]