Turing L-machines and recursive computability for L-maps (Q1263577): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 02:44, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Turing L-machines and recursive computability for L-maps |
scientific article |
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
