Update general computation section

Author: moonsettler

bip-0442.md

@@ -187,7 +187,7 @@ https://github.com/lnhance/bitcoin/pull/6/files
 
 ### Proving general computation using trees
 
-`OP_PAIRCOMMIT` enables Merkle tree commitments, which can represent functions and inputs/outputs. Taproot trees can be 128 levels deep, therefore including up to 2<sup>128</sup> possible leaf scripts. This is already over the practical limits to enumerate and Merklize.
+`OP_PAIRCOMMIT` enables Merkle tree commitments, which can represent functions where inputs and corresponding outputs are the leaves. Taproot trees can be 128 levels deep, therefore including up to 2<sup>128</sup> possible leaf scripts that can represent complex functions. This is already over the practical computational limits to enumerate and Merklize.
 
 ## Backward Compatibility