Skip to content

Commit 9550bfb

Browse files
authored
Fix a spelling error
The word "shoudl" was being replaced with "should".
1 parent c787be0 commit 9550bfb

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

docs/sections/introduction.tex

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -51,7 +51,7 @@ \subsubsection{Components}
5151
\subsubsection{How a Turing Machine works}
5252

5353
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):
5555

5656
\begin{minipage}{0.45\textwidth}
5757
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

Comments
 (0)