Beaver Math Olympiad: Difference between revisions
Jump to navigation
Jump to search
(Created page with "''Beaver Mathematical Olympiad'' is an attempt to re-formulate the halting problem for some particular TMs as mathematical problem in a style suitable for a hypothetical math olympiad. The purpose of BMO is twofold. First, statements where every non-essential details (e.g. related to tape encoding, number of steps, etc) is 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 ques...") |
m (grammar clean-up) |
||
Line 1: | Line 1: | ||
''Beaver Mathematical Olympiad'' is an attempt to re-formulate the halting problem for some particular | ''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 BMO is twofold. First, statements where every non-essential details (e.g. related to tape encoding, number of steps, etc) | 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. | ||
[[Category:Stub]] | [[Category:Stub]] |
Revision as of 08:06, 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.