Beaver Math Olympiad: Difference between revisions
Jump to navigation
Jump to search
m (grammar clean-up) |
(Added the two/three unsolved BMO problems created thus far) |
||
| Line 2: | Line 2: | ||
The purpose of the BMO is twofold. First, statements where every non-essential details (e.g. related to tape encoding, number of steps, etc) are discarded are more suitable to be shared with mathematicians who perhaps are able to help. Second, it's a way to jokingly highlight how a hard question could appear deceptively simple. | The purpose of the BMO is twofold. First, statements where every non-essential details (e.g. related to tape encoding, number of steps, etc) are discarded are more suitable to be shared with mathematicians who perhaps are able to help. Second, it's a way to jokingly highlight how a hard question could appear deceptively simple. | ||
Currently existing BMO problems represent machines: | |||
* [[1RB3RB---3LA1RA 2LA3RA4LB0LB0LA]] (Hydra) | |||
* [[1RB1RA 0LC1LE 1LD1LC 1LA0LB 1LF1RE ---0RA]] (Antihydra) | |||
* [[1RB1RE_1LC0RA_0RD1LB_---1RC_1LF1RE_0LB0LE]] | |||
[[Category:Stub]] | [[Category:Stub]] | ||
Revision as of 08:12, 23 July 2024
Beaver Mathematical Olympiad (BMO) is an attempt to re-formulate the halting problem for some particular Turing machines as a mathematical problem in a style suitable for a hypothetical math olympiad.
The purpose of the BMO is twofold. First, statements where every non-essential details (e.g. related to tape encoding, number of steps, etc) are discarded are more suitable to be shared with mathematicians who perhaps are able to help. Second, it's a way to jokingly highlight how a hard question could appear deceptively simple.
Currently existing BMO problems represent machines: