I think a n-NOR contest could be made practical, at least for a smaller data set like the Calgary corpus (3 MB), if not enwik9, using a state machine made of NOR gates.
A state machine (n1, n2, n3, n4) is specified by the number of input bits n1, state bits n2, gates n3, and output bits n4, followed by a list of n3 gates in ascending order starting at n1+n2+1. Gate number k is specified by a list of inputs in the range 1..k-1 and terminated by 0. The last n2 of those gates are the next state. The last n4 gates are also outputs (overlapping the next state). The initial state is all 0 bits. After each cycle, the last n2 next state bits are moved to the current state n1+1..n1+n2, which must not overlap. For example, the following state machine outputs 0 until it receives a 1 as input, then stays at 1. 1 1 2 1 (1 input, 1 state, 2 gates, 1 output) 1 2 0 (gate 3, input NOR state) 3 0 (gate 4 inverts gate 3, and is also the next state and output). Programs that take file input have 9 input bits for the current input byte in 1..8 (lsb first). Bit 9 is set to 1 at end of input and bits 1..8 are set to 0. There is one input byte per cycle. Programs that produce file output have 9 output bits in the same format. When the last bit is 1, the remaining bits are ignored and execution is terminated. For the contest, there are 0 input bits and 9 output bits. The task is to output enwik9 with the shortest specification (gates + gate inputs). ------------------------------------------ Artificial General Intelligence List: AGI Permalink: https://agi.topicbox.com/groups/agi/T728994814c1a40a0-M2614f53e77f97f06a3185b94 Delivery options: https://agi.topicbox.com/groups/agi/subscription
