There’s a Haskell implementation of modal UDT.
Previous discussion of modal UDT: 1, 2.
FDT is a family of decision theories, modal UDT is a specific algorithm. As stated it requires a hypercomputer, however has bounded variants.
There’s a Haskell implementation of modal UDT.
Previous discussion of modal UDT: 1, 2.
FDT is a family of decision theories, modal UDT is a specific algorithm. As stated it requires a hypercomputer, however has bounded variants.