We are currently working on new rules for what content should and shouldn't be allowed on this website, and are looking for feedback! See Esolang:2026 topicality proposal to view and give feedback on the current draft.
User:Miui/Drafts/WS℈AP
Redirect to:
WS℈AP is an esoteric tabletop game-system which explores the concepts of Wiki-squatting and Agenda pushing.
Computational model
The esolang is a model of the final duel between a Runner and the Corp given a fully complete implementation of The Thought Police.
In this programming language, due to the actions of either (or both) the players there are only two cards left to play.
- "?WikiSquatting"
- "?AgendaPushing"
Instruction set
In A WS℈AP scenario both the runner and corp have access to an infinite number of the following two cards:
1 "?WikiSquatting"
- &
2 "?AgendaPushing".
...in essence:
- The counters which normally govern a game have been sufficiently compromised.
- The game is able to have a deterministic win condition ⇔ the computational model is successfully ≥ Computational class: Finite-state automaton.
- In the case that there is no win condition then the game must be able to be reasoned about with a proof. Such a proof must be able to determine positively that the game-system is TC.
Computational class
The computational class is to be at least a finite-state automaton, at most Turing-complete & is modeled after a reduced instruction set computer.
Undecidability
Under these conditions there is no finite-state automaton, or system of counters which can describe a proof. In order to win a game in this type of The Thought Police scenario a player must construct a proof externally and the opposing player must concede defeat.
Alternate win condition
If either player falls asleep, the more woke player wins.
external resources
symbolic definitions
| Symbol | description | external reference |
|---|---|---|
| ⇔ | "If and only if | https://en.wikipedia.org/wiki/If_and_only_if |
| ≥ | "Greater than or equal to | https://en.wikipedia.org/wiki/Inequality_(mathematics) |
| proof | "A deductive argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion" | https://en.wikipedia.org/wiki/Mathematical_proof |
| TC | "Turing-complete" | https://en.wikipedia.org/wiki/Turing_completeness |
| woke | "wakeful/not asleep" | https://en.wikipedia.org/wiki/Wakefulness |