Probabilistic Choice, Reversibility, Loops, and Miracles

DOI10.1007/978-3-642-16690-7_13zbMATH Open1309.68053OpenAlexW1544951237MaRDI QIDQ3055752FDOQ3055752

Authors: Bill Stoddart, Pete Bell 

Publication date: 9 November 2010

Published in: Unifying Theories of Programming (Search for Journal in Brave)

Full work available at URL: https://research.tees.ac.uk/en/publications/5dd20393-67c6-4c54-9c7a-e763a4ac853d

Recommendations

• Probabilistic computability and choice
• scientific article; zbMATH DE number 1759622
• Irreducible probabilities and indeterminism
• A unification of probabilistic choice within a design-based model of reversible computation
• scientific article; zbMATH DE number 1222675
• scientific article; zbMATH DE number 2043521
• The Combinatorics of Non-determinism
• Randomness notions and reverse mathematics
• scientific article; zbMATH DE number 1324656

zbMATH Keywords

reversibilityiterationexpectationsprobabilistic choiceprospective values

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (5)

• Bunch theory: axioms, logic, applications and model
• Quasi-miracles, typicality, and counterfactuals
• ZB 2005: Formal Specification and Development in Z and B
• Title not available (Why is that?)
• Preference and non-deterministic choice

This page was built for publication: Probabilistic Choice, Reversibility, Loops, and Miracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055752)