From 9a6138b964a1f08b3d13ab5f4be45e6c8f9147b9 Mon Sep 17 00:00:00 2001
From: James Stevens <jdsteve2@illinois.edu>
Date: Mon, 20 Jul 2015 15:21:12 -0500
Subject: [PATCH] fixed spelling in tutorial

---
 doc/tutorial.rst | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/doc/tutorial.rst b/doc/tutorial.rst
index 5dcffbafb..6ab56b248 100644
--- a/doc/tutorial.rst
+++ b/doc/tutorial.rst
@@ -835,7 +835,7 @@ The loopy kernels we have seen thus far have consisted only of assignments
 from one global-memory storage location to another. Sometimes, computation
 results obviously get reused, so that recomputing them or even just
 re-fetching them from global memory becomes uneconomical. Loopy has
-a number of different ways of adressing this need.
+a number of different ways of addressing this need.
 
 Explicit private temporaries
 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
@@ -1320,7 +1320,7 @@ With this parallelization, consecutive threads will access consecutive array ele
 
 ~~~~~~~~~~~
 
-To produce *nonconsecutive* array accesses, we'll switch the inner and outer tags in our parallization of the kernel:
+To produce *nonconsecutive* array accesses, we'll switch the inner and outer tags in our parallelization of the kernel:
 
 .. doctest::
 
-- 
GitLab