Abstract Rewriting Systems (Robbers)
+0
−0
This is somewhat of a [proof-golf]-like [cops-and-robbers]. This is the robbers' thread; the cops' thread can be found here. Sections:
- Robbers
- Determining a winner
Robbers
The cops will be posting abstract rewriting systems in their thread. Your task is to prove that a given cop's target string can or cannot be reached from the source string by applying their rewrite rules. You can do this by either giving a specific sequence of rewrites, or you could prove mathematically if such a sequence does or does not exist. You can view the cops' thread by visiting the link at the top for relevant details and definitions.
Determining a winner
How a winner will be determined:
- The cracks must have happened before March 22nd, 2025 12AM UTC.
- This is to allow time for there to be official cracks of any answers in the cops' thread that were posted close to February 28th, 2025.
- The robber who has cracked the most abstract rewriting systems is the winner.
- If there is a tie, then the total score will be taken into account, with a higher total score preferable.
- If there is still a tie, then the person who cracked the systems over a shorter period of time is the winner.
A Top 10 leaderboard for most cracks (including total score cracked) will be edited in on March 22nd, 2025 at the bottom of the post.
0 answers
0 comment threads