An extension of interval-valued computing equivalent to red-green Turing machines

DOI10.1007/978-3-319-92402-1_8OpenAlexW2804572043MaRDI QIDQ1647321FDOQ1647321

Authors: Benedek Nagy, Sándor Vályi 

Publication date: 26 June 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-92402-1_8

Recommendations

• Circular interval-valued computers and simulation of (red-green) Turing machines
• A Shift-free Characterization of NP within Interval-valued Computing
• Interval-valued computations without the product operator
• Interval-valued computations and their connection with PSPACE
• Computing discrete logarithm by interval-valued paradigm

zbMATH Keywords

massively parallel computingsimulationunconventional computinghypercomputationinterval-valued computingred-green Turing machines

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Other nonclassical models of computation (68Q09) Classical models of computation (Turing machines, etc.) (68Q04)

Cited In (2)

• A Shift-free Characterization of NP within Interval-valued Computing
• Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines

This page was built for publication: An extension of interval-valued computing equivalent to red-green Turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1647321)