You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: docs/sections/introduction.tex
+1-1Lines changed: 1 addition & 1 deletion
Original file line number
Diff line number
Diff line change
@@ -51,7 +51,7 @@ \subsubsection{Components}
51
51
\subsubsection{How a Turing Machine works}
52
52
53
53
To understand how a Turing Machine works, it is beneficial to show an example. The example shows a Turing Machine which has a state machine
54
-
with a ``3-state Busy Beaver''. This program shoudl create as many $1$s on the tape as possible whilst also being finite (not executing indefinitely):
54
+
with a ``3-state Busy Beaver''. This program should create as many $1$s on the tape as possible whilst also being finite (not executing indefinitely):
55
55
56
56
\begin{minipage}{0.45\textwidth}
57
57
Let's say we have a Turing Machine with the symbols $0,1$ and the blank symbol is $0$. We also define that the starting tape consists of blank symbols.
0 commit comments