https://github.com/dzhng/impossible-prompt
https://github.com/dzhng/impossible-prompt
Last synced: 8 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/dzhng/impossible-prompt
- Owner: dzhng
- Created: 2024-04-07T21:06:34.000Z (over 1 year ago)
- Default Branch: main
- Last Pushed: 2024-04-08T16:13:46.000Z (over 1 year ago)
- Last Synced: 2025-01-07T06:15:41.406Z (9 months ago)
- Language: TypeScript
- Size: 15.6 KB
- Stars: 0
- Watchers: 2
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
## Impossible prompt challenge
Initial tweet: https://x.com/VictorTaelin/status/1776677635491344744
Gist: https://gist.github.com/VictorTaelin/e514844f4df9e5f182b28e5a07e44b17
## Prompt
A::B is a system with 4 tokens: `A#`, `#A`, `B#` and `#B`.
An A::B program is a sequence of tokens. Example:
B# A# #B #A B#
To _compute_ a program, we must rewrite neighbor tokens, using the rules:
A# #A ... becomes ... nothing
A# #B ... becomes ... #B A#
B# #A ... becomes ... #A B#
B# #B ... becomes ... nothing
In other words, whenever two neighbor tokens have their '#' facing each-other,
they must be rewritten according to the corresponding rule. For example, the
first example shown here is computed as:
B# A# #B #A B# =
B# #B A# #A B# =
A# #A B# =
B#
The steps were:
1. We replaced `A# #B` by `#B A#`.
2. We replaced `B# #B` by nothing.
3. We replaced `A# #A` by nothing.
The final result was just `B#`.
Now, consider the following program:
Fully compute it, step by step.