Abstract
Given a computational model \({\cal M}\), and a “reasonable” encoding function \({\cal C}: {\cal M} \to \{0,1\}^\ast\) that encodes any computation device M of \({\cal M}\) as a finite bit string, we define the description size of M (under the encoding \({\cal C}\)) as the length of \({\cal C}(M)\). The description size of the entire class \({\cal M}\) (under the encoding \({\cal C}\)) can then be defined as the length of the shortest bit string that encodes a universal device of \({\cal M}\). In this paper we propose the description size as a complexity measure that allows to compare different computational models. We compute upper bounds to the description size of deterministic register machines, Turing machines, spiking neural P systems and UREM P systems. By comparing these sizes, we provide a first partial answer to the following intriguing question: what is the minimal (description) size of a universal computation device?
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baiocchi, C.: Three small universal turing machines. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 1–10. Springer, Heidelberg (2001)
Balcázar, J.L., Díaz, J., Gabarró, J.: Structural Complexity, vol. I and II. Springer, Heidelberg (1988–1990)
Cook, M.: Universality in elementary cellular automata. Complex Systems 15, 1–40 (2004)
Csuhaj–Varjú, E., Margenstern, M., Vaszil, G., Verlan, S.: On small universal antiport P systems. Theoretical Computer Sci. 372, 152–164 (2007)
Freund, R., Leporati, A., Oswald, M., Zandron, C.: Sequential P systems with unit rules and energy assigned to membranes. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 200–210. Springer, Heidelberg (2005)
Freund, R., Oswald, M.: Small universal antiport P systems and universal multiset grammars. In: Proc. 4th Brainstorming Week on Membrane Computing, RGNC Report 03/2006, Fénix Editora, Sevilla, vol. II, pp. 51–64 (2006)
Ionescu, M., Păun, A., Păun, Gh., Jesús Pérez-Jímenez, M.: Computing with spiking neural P systems: Traces and small universal systems. In: Mao, C., Yokomori, T. (eds.) DNA12. LNCS, vol. 4287, pp. 1–16. Springer, Heidelberg (2006)
Ionescu, M., Păun, Gh., Yokomori, T.: Spiking neural P systems. Fundamenta Informaticae 71, 279–308 (2006)
Korec, I.: Small universal register machines. Theoretical Computer Sci. 168, 267–301 (1996)
Kudlek, M.: Small deterministic Turing machines. Theoretical Computer Sci. 168, 241–255 (1996)
Kudlek, M., Rogozhin, Y.: A universal turing machine with 3 states and 9 symbols. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds.) DLT 2001. LNCS, vol. 2295, pp. 311–318. Springer, Heidelberg (2002)
Minsky, M.L.: Size and structure of universal Turing machines using Tag systems. In: Recursive Function Theory, Symp. in Pure Mathematics, pp. 229–238. American Mathematical Society, Providence (1962)
Neary, T., Woods, D.: Small fast universal Turing machines. Theoretical Computer Sci. 362, 171–195 (2006)
Neary, T., Woods, D.: Four small universal turing machines. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 242–254. Springer, Heidelberg (2007)
Woods, D., Neary, T.: Small semi-weakly universal turing machines. In: Durand-Lose, J., Margenstern, M. (eds.) MCU 2007. LNCS, vol. 4664, pp. 303–315. Springer, Heidelberg (2007)
Neary, T., Woods, D.: Small weakly universal Turing machines, arXiv [cs.CC]: 0707.4489v1 (2007)
Păun, A., Păun, Gh.: Small universal spiking neural P systems. BioSystems 90, 48–60 (2007)
Păun, Gh.: Computing with membranes. J. Computer and System Sci. 61, 108–143 (2000)
Păun, Gh.: Membrane Computing. An Introduction. Springer, Heidelberg (2002)
Rogozhin, Y.: Seven universal Turing machines. Math. Issled 69, 76–90 (1982)
Rogozhin, Y.: A universal Turing machine with 10 states and 3 symbols. Izv. Akad. Nauk. Respub. Moldova Mat. 4, 80–82, 95 (1992)
Rogozhin, Y.: Small universal Turing machines. Theoretical Computer Sci. 168, 215–240 (1996)
Rogozhin, Y., Verlan, S.: On the rule complexity of universal tissue P systems. In: Freund, R., Păun, Gh., Rozenberg, G., Salomaa, A. (eds.) WMC 2005. LNCS, vol. 3850, pp. 356–362. Springer, Heidelberg (2006)
Shannon, C.E.: A universal Turing machine with two internal states. Automata Studies, Ann. Math. Stud. 34, 157–165 (1956)
Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Co. (1997)
Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign (2002)
The P systems Web page, http://ppage.psystems.eu/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Leporati, A., Zandron, C., Mauri, G. (2009). How Redundant Is Your Universal Computation Device?. In: Corne, D.W., Frisco, P., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2008. Lecture Notes in Computer Science, vol 5391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-95885-7_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-95885-7_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-95884-0
Online ISBN: 978-3-540-95885-7
eBook Packages: Computer ScienceComputer Science (R0)