A mathematical theory of randomized computation. I

DOI10.3792/PJAA.64.115zbMath0657.68061OpenAlexW2078359033MaRDI QIDQ1111027

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.115

zbMATH Keywords

algorithmic information theoryBanach latticesprobabilistic algorithmsdenotational semanticsrandomized algorithmsrandomized computationmachine learningdomain theoryprobabilistic programming languagesspaces of bounded measures

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)

Related Items (1)

A mathematical theory of randomized computation. II

Cites Work

• Unnamed Item
• Minimal tori in \(S^ 3\) whose lines of curvature lie in \(S^ 2\)
• Concrete representation of abstract (M)-spaces. (A characterization of the space of continuous functions.)
• Data Types as Lattices

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