modified: Documentation/README.html

modified:   README.md

Author: ratwolfzero

Documentation/README.html

@@ -771,7 +771,7 @@ <h3 id="one-pass-approach-with-limited-memory-usage-chunked-or-no-caching">One-P
 </ul>
 <p>*This also applies analogously to any versions that only process floating point values.</p>
 <h3 id="potentially-other-more-sophisticated-solutions">Potentially Other, More Sophisticated Solutions</h3>
-<p>No other one-pass methods offering significant advantages have been identified at this time. More sophisticated solutions would also contradict the minimum complexity design approach unless a significant performance improvement in calculations with a high number of iterations makes them worth considering.</p>
+<p>No other feasible alternative one-pass methods offering substantial advantages have been identified at this time.</p>
 <h3 id="recap">Recap</h3>
 <p>Overall, the two-pass approach offers an excellent balance of speed, efficiency, and simplicity, making it ideal for attractor calculations that involve large number of iterations. While the trajectory points must be computed during both passes, this method successfully avoids the drawbacks associated with alternative solutions.</p>
 <p><a href="#calculate--visualize-the-hopalong-attractor-with-python">Back to Table of Contents</a></p>

README.md

@@ -549,7 +549,7 @@ Data Loss and Inaccuracy: As previously computed floating-point values are irrec
 
 ### Potentially Other, More Sophisticated Solutions
 
-No other one-pass methods offering significant advantages have been identified at this time. More sophisticated solutions would also contradict the minimum complexity design approach unless a significant performance improvement in calculations with a high number of iterations makes them worth considering.
+No other feasible alternative one-pass methods offering substantial advantages have been identified at this time.
 
 ### Recap