A mathematical theory of randomized computation. II

DOI10.3792/pjaa.64.155zbMath0662.68054OpenAlexW4244159943MaRDI QIDQ1114406

Shinichi Yamada

Publication date: 1988

Published in: Proceedings of the Japan Academy. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3792/pjaa.64.155

zbMATH Keywords

Banach latticesprobabilistic algorithmsScott topologyrandomized algorithmsrandomized computationdomain theoryprobabilistic programmingorder topologyleast fixed point

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Banach lattices (46B42) Specification and verification (program logics, model checking, etc.) (68Q60) Computability and recursion theory (03D99) Probability theory on algebraic and topological structures (60B99)

Cites Work

• A mathematical theory of randomized computation. I
• Remark Concerning Integration
• Notes on Integration
• Unnamed Item

This page was built for publication: A mathematical theory of randomized computation. II