diff --git a/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki
index 4fdb96ee..c249f8cc 100644
--- a/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki
+++ b/documentation/current/solutions/concurrent-computing/concurrent-eiffel-scoop/scoop-examples/quicksort.wiki
@@ -11,7 +11,7 @@
 
 The quicksort example is a concurrent implementation of the well-known [http://en.wikipedia.org/wiki/Quicksort quicksort] sorting algorithm developed by computer scientist [http://en.wikipedia.org/wiki/C._A._R._Hoare C. A. R. Hoare]. Quicksort uses a "divide and conquer" strategy to sort a structure. It applies a basic algorithm to the structure which leads to a division of the elements into to two substructures. Then it applies the same algorithm to each of the substructures, and so on, until the whole structure is sorted. Because of the repetitive application of the same algorithm to evolving parts of the structure, the quicksort is often used in computer science classes to provide students with experience in [http://en.wikipedia.org/wiki/Recursion_(computer_science) recursive] computation. 
 
-In the SCOOP example, instead of recursive calls, substructures are handled by separate [[Concurrent Eiffel with SCOOP|SCOOP processors]] running concurrently.
+In the SCOOP example, instead of recursive calls, substructures are handled (within limits) by separate [[Concurrent Eiffel with SCOOP|SCOOP processors]] running concurrently.
 
 
 =Highlights=
@@ -22,5 +22,6 @@ The quicksort algorithm is embodied in the class <code>QUICKSORTER</code>, prima
 
 The structures acted upon by <code>QUICKSORTER</code> are managed in instances of class <code>DATA</code>. <code>DATA</code> is a class designed specifically to support the quicksort example. 
 
+When the example runs, separate <code>QUICKSORTER</code> processes are used for the recursive sorts up until a certain depth of recursion is reached. The limit is defined by the <code>NATURAL</code> constant <code>max_recursion_depth</code>. 
 
 
diff --git a/documentation/current/solutions/concurrent-computing/index.wiki b/documentation/current/solutions/concurrent-computing/index.wiki
index 3ec7105a..182994b1 100644
--- a/documentation/current/solutions/concurrent-computing/index.wiki
+++ b/documentation/current/solutions/concurrent-computing/index.wiki
@@ -1,5 +1,4 @@
-[[Property:title|Concurrent Computing]]
-[[Property:link_title|Concurrent computing]]
+[[Property:title|Concurrent computing]]
 [[Property:weight|-10]]
 [[Property:uuid|7c7a399a-076f-fd13-9b5f-f110c212e2e8]]
 == Concurrent Computing Solutions ==
diff --git a/documentation/current/solutions/preferences/index.wiki b/documentation/current/solutions/preferences/index.wiki
index 5106b7ff..5631ed05 100644
--- a/documentation/current/solutions/preferences/index.wiki
+++ b/documentation/current/solutions/preferences/index.wiki
@@ -1,5 +1,4 @@
-[[Property:title|Application preferences]]
-[[Property:link_title|Preferences]]
+[[Property:title|Preferences]]
 [[Property:weight|-5]]
 [[Property:uuid|08efd11f-6326-90e0-bd63-8dfed4b55890]]
 == Application preferences management solutions ==