Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines

DOI10.3233/FI-2021-2057MaRDI QIDQ5158665

Benedek Nagy, Sándor Vályi

Publication date: 25 October 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

zbMATH Keywords

simulationunconventional computinghypercomputationmassively parallel computinginterval-valued computingred-green Turing machines

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Computation as an unbounded process
• A characterization of the power of vector machines
• Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
• An extension of interval-valued computing equivalent to red-green Turing machines
• An optical model of computation
• Interval-valued computations and their connection with PSPACE
• CLOSED TIMELIKE CURVES IN RELATIVISTIC COMPUTATION
• Prime factorization by interval-valued computing
• A Connection Between Red-Green Turing Machines and Watson-Crick T0L Systems
• A Characterization of NP Within Interval-Valued Computing
• Watson-Crick T0L Systems and Red-Green Register Machines
• A Shift-free Characterization of NP within Interval-valued Computing
• On Computable Numbers, with an Application to the Entscheidungsproblem

This page was built for publication: Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines