Probabilistic Turing machine

Results: 13



#Item
1Under consideration for publication in J. Functional Programming  1 FUNCTIONAL PEARLS Probabilistic Functional Programming in Haskell

Under consideration for publication in J. Functional Programming 1 FUNCTIONAL PEARLS Probabilistic Functional Programming in Haskell

Add to Reading List

Source URL: web.engr.oregonstate.edu

Language: English - Date: 2005-07-18 18:08:19
2Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139

Retraction of Probabilistic Computation and Linear Time Lance Fortnow Michael Sipser MIT Math Dept. Cambridge, MA 02139

Add to Reading List

Source URL: people.cs.uchicago.edu

Language: English - Date: 2010-05-13 09:33:41
3Generating counterexamples for quantitative safety specifications in probabilistic B Ukachukwu Ndukwu1 Department of Computing, Macquarie University, NSW 2109 Sydney, Australia.  Abstract

Generating counterexamples for quantitative safety specifications in probabilistic B Ukachukwu Ndukwu1 Department of Computing, Macquarie University, NSW 2109 Sydney, Australia. Abstract

Add to Reading List

Source URL: web.science.mq.edu.au

Language: English - Date: 2010-04-30 06:17:08
4Modeling and Querying Probabilistic XML Data  1 Benny Kimelfeld

Modeling and Querying Probabilistic XML Data 1 Benny Kimelfeld

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2008-12-18 16:36:47
5LNCSComputational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective

LNCSComputational Proof as Experiment: Probabilistic Algorithms from a Thermodynamic Perspective

Add to Reading List

Source URL: www.ece.rice.edu

Language: English - Date: 2012-08-15 21:56:56
6TWO KINDS OF PROBABILISTIC INDUCTION Ray Solomonoff Visiting Professor, Computer Learning Research Center Royal Holloway, University of London Mailing Address: P.O.B, Cambridge, Ma, U.S.A.

TWO KINDS OF PROBABILISTIC INDUCTION Ray Solomonoff Visiting Professor, Computer Learning Research Center Royal Holloway, University of London Mailing Address: P.O.B, Cambridge, Ma, U.S.A.

Add to Reading List

Source URL: world.std.com

Language: English - Date: 2014-07-03 19:24:34
7Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics. Dorit Aharonov∗and Umesh Vazirani† June 19, 2012  arXiv:1206.3686v1 [quant-ph] 16 Jun 2012

Is Quantum Mechanics Falsifiable? A computational perspective on the foundations of Quantum Mechanics. Dorit Aharonov∗and Umesh Vazirani† June 19, 2012 arXiv:1206.3686v1 [quant-ph] 16 Jun 2012

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2012-06-18 20:15:58
8Proving the power of postselection⋆ Abuzer Yakaryılmaz1, ⋆⋆ and A.C. Cem Say2, ⋆ ⋆ ⋆ 1 arXiv:1111.3125v1 [cs.CC] 14 Nov 2011

Proving the power of postselection⋆ Abuzer Yakaryılmaz1, ⋆⋆ and A.C. Cem Say2, ⋆ ⋆ ⋆ 1 arXiv:1111.3125v1 [cs.CC] 14 Nov 2011

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2013-12-19 23:31:39
9Axiomatising physical experiments as oracles to algorithms Edwin J. Beggsa , Jos´e F´elix Costab∗ , and John V. Tuckerc a Department of Mathematics, College of Sciences, Swansea University, Swansea SA2 8PP, Wales, Un

Axiomatising physical experiments as oracles to algorithms Edwin J. Beggsa , Jos´e F´elix Costab∗ , and John V. Tuckerc a Department of Mathematics, College of Sciences, Swansea University, Swansea SA2 8PP, Wales, Un

Add to Reading List

Source URL: www-compsci.swan.ac.uk

Language: English - Date: 2012-04-11 07:58:28
10i  Computational Complexity: A Modern

i Computational Complexity: A Modern

Add to Reading List

Source URL: www.cs.princeton.edu

Language: English - Date: 2007-01-08 22:01:30