Turing L-machines and recursive computability for L-maps (Q1263577)
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: Turing L-machines and recursive computability for L-maps |
scientific article; zbMATH DE number 4127187
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Turing L-machines and recursive computability for L-maps |
scientific article; zbMATH DE number 4127187 |
Statements
Turing L-machines and recursive computability for L-maps (English)
0 references
1989
0 references
This paper's author and the reviewer have - working independently, but using similar approaches - investigated the fuzzification of recursion theory. Earlier work by Santos on fuzzy algorithms followed a different approach. This paper ties the two strands of thought together. Specifically, two definitions (one weaker, one stronger) of p.r. fuzzy map are given in the vein of the author's previous work. Properties of such maps are then investigated, in particular their relations to Santos' fuzzy Turing machines.
0 references
partial recursive fuzzy map
0 references
fuzzification of recursion theory
0 references
fuzzy Turing machines
0 references
0.8818046
0 references
0.8687555
0 references
0 references
0.86802256
0 references
0.85712755
0 references
0 references
0.85581064
0 references
