Talk:HEX

Computational class
The computational class depends on whether individual bugs have infinite data capacity. If they do, the language is Turing-Complete; otherwise it's a finite state machine. In the reference implementation, the bugs have only a finite capacity, so it is a state machine. lament 17:15, 19 June 2007 (UTC)


 * Theres a finite limit? I didn't knowingly create one, so it may be a PHP thing. Theoretically, they have an unlimited capacity. Sorry if I complete misunderstood you, i'm pretty new to esoteric programming languages in general (especially to making them). Barrucadu 21:01, 19 June 2007 (UTC)


 * After checking,

GBL; Bug("foo", "99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999"); Breed("foo" * "foo"); Scuttle("foo"); Write;
 * Results in +++ INF +++
 * If I can figure out how, i'll write a compiler at some point, so there will be no limts imposed by the language the interpreter is written in. Barrucadu 19:39, 20 June 2007 (UTC)
 * Whats about ignore that limit by simulating some unsigned counters by two strings (for each counter)? given two variables that contains at the start the empty string: "splus","sminus" and a constant string "a" that contains "a"; increment will be:

Breed( "splus"+"a");
 * Decrement:

Breed("sminus"+"a");
 * Check if zero:

Fork("splus"=="sminus"); Goto IfZero; EndFork; Goto IfNotZero;