Interactive Computation: Stepping Stone in the Pathway From Classical to Developmental Computation

On the computing power of fuzzy Turing machines

“…The same proof can also be carried on with intervals of the form (a 2i , a 2i+1 ] in (7). Also, intervals of the form (a 2i , a 2i+1 ) or [a 2i , a 2i+1 ) can be used, provided one adds to the set the real 1 in the case that n is odd.…”

“…Unfortunately the research in this subject was not continued for more than a decade, revisited only in the works of Harkleroad [16] (for other related works, see for example [6,3,25,11,26,4,27,12]). More recently, with the increasing interest in extrapolating Church-Turing thesis considering other aspects (for example interactions [14,7], real values [35], quantum universe [9], etc. ), the research on fuzzy computability has gained new strength, mainly because Wiedermann [36,37] claimed that it is possible to solve the halting problem (more precisely, it is possible to accept recursively enumerables r.e., sets and co-r.e.…”