Circular interval-valued computers and simulation of (red-green) Turing machines
From MaRDI portal
Publication:5158665
Recommendations
- An extension of interval-valued computing equivalent to 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
Cites work
- A characterization of NP within interval-valued computing
- A characterization of the power of vector machines
- A connection between red-green Turing machines and Watson-Crick T0L systems
- A Shift-free Characterization of NP within Interval-valued Computing
- An extension of interval-valued computing equivalent to red-green Turing machines
- An optical model of computation
- Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines
- Closed timelike curves in relativistic computation
- Computation as an unbounded process
- Computing discrete logarithm by interval-valued paradigm
- Interval-valued computations and their connection with PSPACE
- On Computable Numbers, with an Application to the Entscheidungsproblem
- Prime factorization by interval-valued computing
- Watson-Crick T0L Systems and Red-Green Register Machines
Cited in
(4)
This page was built for publication: Circular interval-valued computers and simulation of (red-green) Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5158665)
