Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Challenges

Post History

50%
+0 −0
Challenges Abstract Rewriting Systems (Robbers)

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 wil...

0 answers  ·  posted 27d ago by CrSb0001‭  ·  edited 27d ago by CrSb0001‭

#2: Post edited by user avatar CrSb0001‭ · 2024-11-22T02:36:59Z (27 days ago)
  • <sup>This is somewhat of a [proof-golf]-like [cops-and-robbers]. This is the robbers' thread; the cops' thread can be found [here]().</sup>
  • 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:
  • >1. 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.
  • >2. 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.
  • <sup>This is somewhat of a [proof-golf]-like [cops-and-robbers]. This is the robbers' thread; the cops' thread can be found [here](https://codegolf.codidact.com/posts/293001).</sup>
  • 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:
  • >1. 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.
  • >2. 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.
#1: Initial revision by user avatar CrSb0001‭ · 2024-11-22T02:35:49Z (27 days ago)
Abstract Rewriting Systems (Robbers)
<sup>This is somewhat of a [proof-golf]-like [cops-and-robbers]. This is the robbers' thread; the cops' thread can be found [here]().</sup>
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:
>1. 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.
>2. 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.