Lines Matching +full:turing +full:- +full:complete

1 // RUN: %clang_cc1 -verify -std=c++11 %s
2 // expected-no-diagnostics
4 // A direct proof that constexpr is Turing-complete, once DR1454 is implemented.
6 const unsigned halt = (unsigned)-1;
22     l(dir == L ? old.l ? old.l->l : 0 : &old),  in Tape()
23     val(dir == L ? old.l ? old.l->val : false  in Tape()
24                  : old.r ? old.r->val : false),  in Tape()
25     r(dir == R ? old.r ? old.r->r : 0 : &old) {}  in Tape()
33 // Run turing machine 'tm' on tape 'tape' from state 'state'. Return number of
42 // 3-state busy beaver. S(bb3) = 21.
50 // 4-state busy beaver. S(bb4) = 107.