Pages that link to "Item:Q5658085"
From MaRDI portal
The following pages link to Computability by Probabilistic Turing Machines (Q5658085):
Displayed 12 items.
- Multihead two-way probabilistic finite automata (Q675857) (← links)
- Probabilistic Turing machines and recursively enumerable Dedekind cuts (Q802546) (← links)
- Introduction to the concept of recursiveness of fuzzy functions (Q1100197) (← links)
- Probabilistic automata (Q1151262) (← links)
- Fuzzy and probabilistic programs (Q1229093) (← links)
- Efficient simulations by a biased coin (Q1352086) (← links)
- A thesis for interaction (Q2055962) (← links)
- Characterizations of semantic domains for randomized algorithms (Q4729388) (← links)
- (Q5089021) (← links)
- (Q5094133) (← links)
- Multihead two-way probabilistic finite automata (Q5096345) (← links)
- On counting propositional logic and Wagner's hierarchy (Q6100184) (← links)