Interval-valued computations and their connection with PSPACE

DOI10.1016/j.tcs.2007.12.013zbMath1136.68024OpenAlexW2070955516MaRDI QIDQ2482463

Benedek Nagy, Sándor Vályi

Publication date: 16 April 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.12.013

zbMATH Keywords

parallel computingalgorithmic complexitynew computing paradigms

Mathematics Subject Classification ID

Related Items (2)

Non-isometric Contextual Array Grammars with Regular Control and Local Selectors ⋮ Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• Analog computation via neural networks
• An optical model of computation
• Membrane computing. An introduction.
• The CNN universal machine: an analogic array computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• SOFSEM 2006: Theory and Practice of Computer Science
• Non-Turing computations via Malament--Hogarth space-times

This page was built for publication: Interval-valued computations and their connection with PSPACE