Finite approximate approach to the study of the complexity of recursive predicates (Q1255316)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Finite approximate approach to the study of the complexity of recursive predicates |
scientific article; zbMATH DE number 3622942
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finite approximate approach to the study of the complexity of recursive predicates |
scientific article; zbMATH DE number 3622942 |
Statements
Finite approximate approach to the study of the complexity of recursive predicates (English)
0 references
1978
0 references
Complexity of Recursive Predicates
0 references
Partial Recursive Function
0 references
Finite Automaton
0 references
Turing Machine
0 references
0 references
