For a given target system and apparatus described by quantum theory, the so-called no-programming theorem indicates that family of states called programs in with fixed unitary operation on total distinct dynamics to only if initial are orthogonal each other. The current study aims at revealing whether similar behavior can be observed generalized probabilistic theories (GPTs). Generalizing progr...

Forward inference techniques such as sequential Monte Carlo and particle Markov chain Monte Carlo for probabilistic programming can be implemented in any programming language by creative use of standardized operating system functionality including processes, forking, mutexes, and shared memory. Exploiting this we have defined, developed, and tested a probabilistic programming language intermedi...

A multitude of different probabilistic programming languages exists today, all extending a traditional programming language with primitives to support modeling of complex, structured probability distributions. Each of these languages employs its own probabilistic primitives, and comes with a particular syntax, semantics and inference procedure. This makes it hard to understand the underlying pr...

in traditional portfolio selection model coefficients often are certain and deterministic, but in real world these coefficients are probabilistic. so decision maker cannot estimate them exactly. financial optimization is one of the most attractive areas in decision under uncertainty. in the portfolio selection problem the decision maker considers simultaneously conflicting objectives such as ra...