Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917)
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: Automata theory based on complete residuated lattice-valued logic: Turing machines |
scientific article; zbMATH DE number 6111164
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Automata theory based on complete residuated lattice-valued logic: Turing machines |
scientific article; zbMATH DE number 6111164 |
Statements
Automata theory based on complete residuated lattice-valued logic: Turing machines (English)
0 references
29 November 2012
0 references
nonclassical logic
0 references
residuated lattices
0 references
Turing machines
0 references
recursively enumerable languages
0 references
universal Turing machines
0 references
0 references
0 references
0 references
0.8413501977920532
0 references
0.8362312912940979
0 references
0.8238933086395264
0 references
0.8196104764938354
0 references
