Talk:Chicken

Marvelous, got me laughing in the middle of the linux lab... User:PixelatedStarfish

This language is very similar to what I was going to do for Rec+... --D (talk) 06:05, 23 August 2023 (UTC)

Why is chicken Turing complete

--None1 (talk) 14:04, 22 August 2023 (UTC)

If we assume that integers in Chicken are unbounded, we can compile the Minsky machine to it, by hosting two counters on the stack.

• 11 2 to increment first counter
• 10 6 11 2 10 7 to increment second counter
• 11 3 to decrement first counter
• 10 6 11 3 10 7 to decrement second counter
• 11 6 10 5 <offset> 8 to jump if first counter = 0
• 10 6 10 5 <offset> 8 to jump if second counter = 0

--D (talk) 08:01, 23 August 2023 (UTC)