So a Turing-complete language can be non-Square-complete? ↑ (↑↑↑) 15:44, 1 December 2025 (UTC)
- Sure. Don't take it seriously; it's a joke page that I'm pushing to have either categorized with other joke concepts or deleted. Corbin (talk) 15:44, 1 December 2025 (UTC)