Abstract
The Turing machine is the archetypal conceptual computing device and as such it is almost always used to define new models of computations by augmenting the functionality of the machine. For example, as was explained in Sect. 2.2.2, a probabilistic model of computation is defined by introducing a probabilistic version of the Turing machine, that is, a machine that operates nondeterministically. Therefore, it was quite expected to see the emergence of fuzzy Turing machines as models of fuzzy computation, that is, computation that encompasses vagueness in the form of fuzziness as a basic ingredient of computation.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Donald M. Kaplan [71] had used regular expressions to represent elementary programs in order to study program equivalence.
- 2.
In fact, Santos, following Scott, had defined a program to be a set of commands. Note that typically an ordinary program is understood to be a sequence of commands to be executed in that particular order. But since there is no implicit order in the way one may pick up elements from any set, it is better to talk about sequences than sets.
- 3.
This last clarification is actually a proposition; nevertheless, its proof is trivial and not necessary for what comes next.
- 4.
The original text mentions that \(\mathcal{M}\) functions in essentially the same way as the Turner machine defined in [117]. Unfortunately, there is no mention of a Turner machine in [117]. Moreover, to the best of my knowledge, there is no abstract machine called Turner machine! Chances are that this was a typo and that the text refers to the Turing machine mentioned in [117].
- 5.
A t-norm ∧ : [0, 1] ×[0, 1] → [0, 1] can be seen as a fuzzy relation on [0, 1]; thus, one can compute its transitive closure.
- 6.
In the original paper, the second condition is “0 ≤ b < 1,” which is obviously a typo since in what follows the authors use “a” instead of “b”.
- 7.
Gerla [49] uses instead the term recursively co-enumerable, which does not make any sense to this author.
- 8.
The proofs are omitted since the original text is in Spanish and my knowledge of this language is nonexistent.
References
Akl, S.G.: Three Counterexamples to dispel the myth of the universal computer. Parallel Process. Lett. 16, 381–403 (2006)
Akl, S.G.: Even accelerating machines are not universal. Int. J. Unconventional Comput. 3, 105–121 (2007)
Bedregal, B.C., Figueira, S. On the computing power of fuzzy Turing machines. Fuzzy Set. Syst. 159, 1072–1083 (2008)
Biacino, L., Gerla, G.: Decidability, recursive enumerability and kleene hierarchy for L-subsets. Zeitschrift für mathematische Logik und Grundlagen der Mathematik 34, 49–62 (1989)
Biacino, L., Gerla, G.: Fuzzy logic, continuity and effectiveness. Archive Math. Logic 41(7), 643–667 (2002)
Boolos, G.S., Burgess, J.P., Jeffrey, R.C.: Computability and Logic, 4th edn. Cambridge University Press, Cambridge (2002)
Castro, J.L., Delgado, M., Mantas, C.J.: A new approach for the execution and adjustment of a fuzzy algorithm. Fuzzy Set. Syst. 121, 491–503 (2001)
Chang, S.-K.: On the execution of fuzzy programs using finite-state machines. IEEE Trans. Comput. C-21(3), 241–253 (1972)
Clares, B.: Una introduccion a la W-calculabilidad: Operaciones basicas. Stochastica 7(2), 111–135 (1983)
Clares, B., Delgado, M.: Introduction to the concept of recursiveness of fuzzy functions. Fuzzy Set. Syst. 21(3), 301–310 (1987)
Cleland, C.E.: On effective procedures. Mind. Mach. 12, 159–179 (2002)
Gerla, G.: Fuzzy ogic: Mathematical Tools for Approximate Reasoning. Kluwer Academic Publishers, Dordrecht (2001)
Gerla, G.: Effectiveness and multivalued logics. J. Symbolic Logic 71(1), 137–162 (2006)
Gerla, G.: Multi-valued logics, effectiveness and domains. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) Computation and Logic in the Real World, Proceedings of Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 2007. Lecture Notes in Computer Science, vol. 4497, pp. 336–347. Springer, Berlin (2007)
Hájek, P.: Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, Dordrecht (1998)
Harkleroad, L.: Fuzzy recursion, RET’s and isols. Math. Logic Quart. 30(26–29), 425–436 (1984)
Kaplan, D.M.: Regular expressions and the equivalence of programs. J. Comput. Syst. Sci. 3, 361–386 (1969)
Lee, E., Zadeh, L.A.: Note on fuzzy languages. Inf. Sci. 1, 421–434 (1969)
Li, Y.: Approximation and universality of fuzzy Turing machines. Sci. China Ser. F Inf. Sci. 51(10), 1445–1465 (2008)
Li, Y.: Fuzzy Turing machines: Variants and universality. IEEE Trans. Fuzzy Syst. 16(6), 1491–1502 (2008)
Li, Y.: Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency. Fuzzy Set. Syst. 160, 3453–3474 (2009)
Li, Y.: Some results of fuzzy Turing machines. In: IEEE Proceedings of the 6th World Congress in Intelligent Control and Automation, pp. 3406–3409 (2006)
Moraga, C. Towards a fuzzy computability? Math. Soft Comput. 6, 163–172 (1999)
Mordeson, J.N., Malik, D.S.: Fuzzy Automata and Languages: Theory and Applications. Chapman and Hall/CRC, Boca Raton (2002)
Păun, G., Rozenberg, G., Salomaa, A.: DNA Computing. Springer, Berlin (1998)
Rocha, A., Rebello, M., Miura, K.: Toward a theory of molecular computing. Inf. Sci. 106, 123–157 (1998)
Santos, E.S.: Maximin sequential-like machines and chains. Theory Comput. Syst. 3(4), 300–309 (1969)
Santos, E.S.: Fuzzy algorithms. Inf. Contr. 17, 326–339 (1970)
Santos, E.S.: Machines, programs and languages. Cybernet. Syst. 4(1), 71–86 (1974)
Santos, E.S.: Fuzzy and probabilistic programs. Inf. Sci. 10, 331–345 (1976)
Scott, D.: Some definitional suggestions for automata theory. J. Comput. Syst. Sci. 1(2), 187–212 (1967)
Syropoulos, A.: Hypercomputation: Computing Beyond the Church-Turing Barrier. Springer New York, Inc., Secaucus (2008)
Tanaka, K., Mizumoto, M.: Fuzzy programs and their executions. In: Zadeh, L.A., Fu, K.-S., Tanaka, K., Shimura, M. (eds.) Fuzzy Sets and Their Applications to Cognitive and Decision Processes, pp. 41–76. Academic Press, New York (1975)
Vučković, V.: Basic theorems on Turing algorithms. Publ. l’Institut Math. (Beograd) 1(15), 31–65 (1961)
Wiedermann, J.: Fuzzy Turing machines revised. Comput. Inform. 21(3), 1–13 (2002)
Wiedermann, J.: Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines. Theor. Comput. Sci. 317, 61–69 (2004)
Zadeh, L.A.: Fuzzy algorithms. Inf. Contr. 12, 94–102 (1968)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Syropoulos, A. (2014). On Fuzzy Turing Machines. In: Theory of Fuzzy Computation. IFSR International Series on Systems Science and Engineering, vol 31. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-8379-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-4614-8379-3_4
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-8378-6
Online ISBN: 978-1-4614-8379-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)