1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
|
// RUN: %clang_cc1 -verify -std=c++2a %s
// expected-no-diagnostics
const unsigned halt = (unsigned)-1;
enum Dir { L, R };
struct Action {
bool tape;
Dir dir;
unsigned next;
};
using State = Action[2];
// An infinite tape!
struct Tape {
constexpr Tape() = default;
constexpr ~Tape() {
if (l) { l->r = nullptr; delete l; }
if (r) { r->l = nullptr; delete r; }
}
constexpr Tape *left() {
if (!l) { l = new Tape; l->r = this; }
return l;
}
constexpr Tape *right() {
if (!r) { r = new Tape; r->l = this; }
return r;
}
Tape *l = nullptr;
bool val = false;
Tape *r = nullptr;
};
// Run turing machine 'tm' on tape 'tape' from state 'state'. Return number of
// steps taken until halt.
constexpr unsigned run(const State *tm) {
Tape *tape = new Tape;
unsigned state = 0;
unsigned steps = 0;
for (state = 0; state != halt; ++steps) {
auto [val, dir, next_state] = tm[state][tape->val];
tape->val = val;
tape = (dir == L ? tape->left() : tape->right());
state = next_state;
}
delete tape;
return steps;
}
// 3-state busy beaver. S(bb3) = 21.
constexpr State bb3[] = {
{ { true, R, 1 }, { true, R, halt } },
{ { true, L, 1 }, { false, R, 2 } },
{ { true, L, 2 }, { true, L, 0 } }
};
static_assert(run(bb3) == 21, "");
// 4-state busy beaver. S(bb4) = 107.
constexpr State bb4[] = {
{ { true, R, 1 }, { true, L, 1 } },
{ { true, L, 0 }, { false, L, 2 } },
{ { true, R, halt }, { true, L, 3 } },
{ { true, R, 3 }, { false, R, 0 } } };
static_assert(run(bb4) == 107, "");
|
