Abstract
In this paper, a syntactic subclass of polynomial size interval-valued computations is given that characterizes NP, that is, exactly languages with non-deterministically polynomial time complexity can be decided by interval-valued computations of this subclass. This subclass refrains from using product and shift operators aside from a starting section of the computation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Calude, C.S., Păun, G.: Computing with Cells and Atoms: An Introduction to Quantum, DNA and Membrane Computing. Taylor & Francis/Hemisphere, London, Bristol (2001)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
McKenzie, P., Wagner, K.W.: The complexity of membership problems for circuits over sets of natural numbers. Comput. complex. 16(3), 211–244 (2007)
Nagy, B.: A general fuzzy logic using intervals, In: HUCI 2005: 6th International Symposium of Hungarian Researchers on Computational Intelligence, Budapest, Hungary, pp. 613–624 (2005)
Nagy, B.: An interval-valued computing device. In: CiE 2005, Computability in Europe: New Computational Paradigms, Amsterdam, Netherlands, pp. 166–177 (2005)
Nagy, B.: Új Számítási Paradigmák: Bevezetés az Intervallum-értékű, a DNS-, a Membrán- és a Kvantumszámítógépek elméletébe (New Computing Paradigms: Introduction to Interval-Valued, DNA, Membrane and Quantum Computing, in Hungarian). Typotex, Budapest (2014)
Nagy, B., Major, S.R.: Connection between interval-valued computing and cellular automata. In: CINTI 2013: 14th IEEE International Symposium on Computational Intelligence and Informatics, Budapest, Hungary, pp. 225–230 (2013)
Nagy, B., Vályi, S.: Solving a PSPACE-complete problem by a linear interval-valued computation. In: CiE 2006, Computability in Europe: Logical Approaches to Computational Barriers. University of Wales, Swansea, UK, pp. 216–225 (2006)
Nagy, B., Vályi, S.: Visual reasoning by generalized interval-values and interval temporal logic. In: CEUR Workshop Proceedings, vol. 274, pp. 13–26 (2007)
Nagy, B., Vályi, S.: Interval-valued computations and their connection with PSPACE. Theor. Comput. Sci. 394, 208–222 (2008)
Nagy, B., Vályi, S.: Prime factorization by interval-valued computing. Publicationes Mathematicae Debrecen 79, 539–551 (2011)
Nagy, B., Vályi, S.: Computing discrete logarithm by interval-valued paradigm. Electron. Proc. Theor. Comput. Sci. 143, 76–86 (2014)
Papadimitriou, C.: Computational Complexity. Addison Wesley, Reading (1994)
Păun, Gh., Rozenberg, G., Salomaa, A.: DNA Computing: New computing paradigms. Springer, Berlin (1998)
Păun, G., Rozenberg, G., Salomaa, A. (eds.): Handbook of Membrane Computing. Oxford University Press, Oxford (2010)
Rozenberg, G., Bäck, T., Kok, J.N. (eds.): Handbook of Natural Computing. Springer, Heidelberg (2012)
Sipser, M.: Introduction to the Theory of Computation. Cengage Learning, Boston (2012)
Woods, D., Naughton, T.J.: Optical computing. Appl. Math. Comput. 215, 1417–1430 (2009)
Acknowledgments
Reviewers’ remarks and advices are gratefully acknowledged.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Nagy, B., Vályi, S. (2015). A Characterization of NP Within Interval-Valued Computing. In: Durand-Lose, J., Nagy, B. (eds) Machines, Computations, and Universality. MCU 2015. Lecture Notes in Computer Science(), vol 9288. Springer, Cham. https://doi.org/10.1007/978-3-319-23111-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-23111-2_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23110-5
Online ISBN: 978-3-319-23111-2
eBook Packages: Computer ScienceComputer Science (R0)