It should be known to the reader that a blockchain network determines the true value of its token dynamically. To accurately measure the effort spent by the network to ensure the unit value of its token, all we need is a DMMS algorithm which is simply a proof-of-work blockchain.
When multiple tokens are implemented on a single blockchain, the ledger is not able to accurately measure the value of a unit. However, in the case of functional languages, users could imagine a lisp blockchain with paul graham's 7 primitives which are implemented as an opcode. This would be Turing complete but will adhere to the problem of determining the true value of each opcode and the cheapest one will always be abused.
For achieving a functional Turing complete blockchain, users need a braided network of 7 blockchains, each of which can independently determine the true value of effort required for that primitive calculation.