User contributions for Pericles
Jump to navigation
Jump to search
29 April 2025
- 06:2806:28, 29 April 2025 diff hist +5 m Bitforth No edit summary current
- 06:2706:27, 29 April 2025 diff hist +82 m Bitforth No edit summary
- 04:4304:43, 29 April 2025 diff hist +18 m Bitforth No edit summary
- 04:3904:39, 29 April 2025 diff hist +3 m Bitforth →Queue Implementation
- 04:3504:35, 29 April 2025 diff hist +4 m Bitforth No edit summary
- 04:3304:33, 29 April 2025 diff hist −21 m Bitforth No edit summary
28 April 2025
- 16:3916:39, 28 April 2025 diff hist +15 Language list No edit summary
- 16:3416:34, 28 April 2025 diff hist +2,772 N Bitforth Created page with "'''Bitforth''' is an ultra-minimal subset of Forth that achieves Turing completeness using only: * A data stack and a call stack * Integer literals (0, 1, -1) * Colon definitions with calls/returns (including recursion) * Multi-way branches (<code>CASE ... OF ... ENDOF ... ENDCASE</code>) By using the data stack as a queue and employing a simple recursive trick to enqueue bits at the bottom, Bitforth can simulate any tag system, and therefore any Turing machine. I..."
- 15:0715:07, 28 April 2025 diff hist +141 Esolang:Introduce yourself No edit summary