diff options
Diffstat (limited to 'entries/jj/tm/fib.txt')
| -rw-r--r-- | entries/jj/tm/fib.txt | 14 |
1 files changed, 0 insertions, 14 deletions
diff --git a/entries/jj/tm/fib.txt b/entries/jj/tm/fib.txt index 3c6187a..43f4e55 100644 --- a/entries/jj/tm/fib.txt +++ b/entries/jj/tm/fib.txt @@ -30,8 +30,6 @@ A Turing machine is a 7-tuple T = (Q,Σ,Γ,δ,qI,qA,qR) where: - qA: the machine does not accept. - qR: the machine does not reject. -states c*: clearing the initial tape - δ(ca, Γ) -> (cb, $, R) δ(cb, Γ) -> (cc, 0, R) δ(cc, Γ) -> (cd, $, R) @@ -42,9 +40,6 @@ states c*: clearing the initial tape δ(ch, Γ \ _) -> (ci, _, R) δ(ch, _) -> (sa, , ) - -states s*: making space for the next number - δ(sa, Γ \ $) -> (sa, , L) δ(sa, $) -> (sb, , L) δ(sb, Γ \ {0,1,$}) -> (sb, , L) @@ -58,9 +53,6 @@ states s*: making space for the next number δ(sd, 1*) -> (sd, 1, R) δ(sd, _) -> (aa, , L) - -states a*: add the last digit of both numbers without carrying - δ(aa, Γ \ $) -> (aa, , L) δ(aa, $) -> (ab, , L) δ(ab, 0) -> (aaa, 0*, L) @@ -100,9 +92,6 @@ states a*: add the last digit of both numbers without carrying δ(abh, Γ \ X) -> (abh, , L) δ(abh, X) -> (ba, 0, L) - -states b*: add the last digit of both numbers while carrying a one - δ(ba, Γ \ $) -> (ba, , L) δ(ba, $) -> (bb, , L) δ(bb, 0) -> (baa, 0*, L) @@ -137,9 +126,6 @@ states b*: add the last digit of both numbers while carrying a one δ(bbf, Γ \ X) -> (bbf, , L) δ(bbf, X) -> (ba, 1, L) - -states c*: scooting over the computed number to make space for a carried digit - δ(ca, Γ \ $) -> (ca, , L) δ(ca, $) -> (cb, , L) |