Turing machines based on unsharp quantum logic


In this paper, we consider Turing machines based on unsharp quantum logic. For a lattice-ordered quantum multiple-valued (MV) algebra E , we introduce E -valued non-deterministic Turing machines (E NTMs) and E -valued deterministic Turing machines (E DTMs). We discuss different E valued recursively enumerable languages from width-first and depth-first… (More)
DOI: 10.4204/EPTCS.95.17



Citations per Year

Citation Velocity: 4

Averaging 4 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.