Index: doc/theses/mike_brooks_MMath/intro.tex
===================================================================
--- doc/theses/mike_brooks_MMath/intro.tex	(revision 3c5fdb54dad1fa0471b7cdafa69972af91c7c550)
+++ doc/theses/mike_brooks_MMath/intro.tex	(revision 5faa3a5390d1a4845f728030a7e3e373db2eaaac)
@@ -71,5 +71,5 @@
 Among the linked structures, the list's defining characteristic is maintaining a user-explicit total order (chain shape).
 Element search can be by position (as for array) or by value; it is sometimes presented as a subscript.
-In a more complex structure, the linked shape may be system managed (user impicit) by being a function of a designated ``key'' datum, \eg often for a hash table.
+In a more complex structure, the linked shape may be system managed (user implicit) by being a function of a designated ``key'' datum, \eg often for a hash table.
 Though such schemes often give better-than-$O(n)$ lookup, the linked list's user-explicit shape limits what the system can provide, to fast step/iteration for user-``nearby'' data, and slow exhaustive search/seek otherwise.
 Linked types are dynamically sized by adding and removing nodes using link fields internal or external to the list elements (nodes).