Notes-on-using-Lem's-algorithm-interface.md

@@ -263,7 +263,7 @@ If Node 1 were to need to feed it's results to a next higher level, its `interme
 comp1.intermediate_results = output1234.intermediate_results
 ``` 
 
-<h2>A comment on intermediate_results<h2>
+<h2>A comment on intermediate_results</h2>
 
 For the trust-weighted histogram algorithm the `intermediate_results` are really the same thing as the output. Therefore it is possible that these could be folded together and not require the extra variable. However, it is convenient to use this variable for differentiating between nodes that have not yet been binned because they are the first nodes in the calculation, and those that have. Those that have then simply use the `intermediate_results` and those that haven't need to undergo a binning process (done in `GetHForAllLeafNodes`). For the straight average algorithm, however, the output and the `intermediate_results` are completely different.