A lazily evaluated, natively parallelized stochastic lambda calculus with Church-like query operators is still merely probabilistic-Turing-complete.
Arrrrrgh now you've got my CS401 knowledge screaming that someone is wrong on the internet.
A lazily evaluated, natively parallelized stochastic lambda calculus with Church-like query operators is still merely probabilistic-Turing-complete.
Arrrrrgh now you've got my CS401 knowledge screaming that someone is wrong on the internet.