Index: doc/theses/colby_parsons_MMAth/text/channels.tex
===================================================================
--- doc/theses/colby_parsons_MMAth/text/channels.tex	(revision 44198fb9159caf1a5c6b949919830261ff7d2f2c)
+++ doc/theses/colby_parsons_MMAth/text/channels.tex	(revision b51b2a66357efaa480b18720757dd93f78c38e23)
@@ -74,5 +74,5 @@
 This approach is similar to wait morphing for locks~\cite[p.~82]{Butenhof97} and improves performance in a few ways.
 First, each thread interacting with the channel only acquires and releases the internal channel lock once.
-As a result, contention on the internal lock is decreased, threads only compete for the lock upon entry, as unblocking threads do not reacquire the lock.
+As a result, contention on the internal lock is decreased, as only entering threads compete for the lock as unblocking threads do not reacquire the lock.
 The other advantage of Go's wait-morphing approach is that it eliminates the bottleneck of waiting for signalled threads to run.
 Note, the property of acquiring/releasing the lock only once can also be achieved with a different form of cooperation, called \Newterm{baton passing}.