Pages that link to "Item:Q5579493"
From MaRDI portal
The following pages link to Probabilistic Turing Machines and Computability (Q5579493):
Displayed 11 items.
- On using probabilistic Turing machines to model participants in cryptographic protocols (Q391316) (← links)
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Probabilistic Turing machines and recursively enumerable Dedekind cuts (Q802546) (← links)
- Randomized algorithms in combinatorial optimization: A survey (Q1077329) (← links)
- Probabilistic automata (Q1151262) (← links)
- On tape-bounded probabilistic Turing machine acceptors (Q1158756) (← links)
- A probabilistic model of computing with words (Q1776375) (← links)
- Bayesian estimation and the Kalman filter (Q1903220) (← links)
- On Higher-Order Probabilistic Subrecursion (Q2988381) (← links)
- Characterizations of semantic domains for randomized algorithms (Q4729388) (← links)
- Computability by Probabilistic Turing Machines (Q5658085) (← links)