Probabilistic Recursion Theory and Implicit Computational Complexity (Q4621181)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7020177
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Probabilistic Recursion Theory and Implicit Computational Complexity |
scientific article; zbMATH DE number 7020177 |
Statements
Probabilistic Recursion Theory and Implicit Computational Complexity (English)
0 references
8 February 2019
0 references
probabilistic recursion theory
0 references
implicit computational complexity
0 references
probabilistic Turing machines
0 references
1.0000002
0 references
0.90893817
0 references
0.90417355
0 references
0.8996897
0 references
0.8936241
0 references
0 references
0.88712054
0 references
