Skip to main content
SpringerLink
Log in

From Parallelism to Nonuniversality: An Unconventional Trajectory

  • Chapter
  • First Online:
From Astrophysics to Unconventional Computation

Part of the book series: Emergence, Complexity and Computation ((ECC,volume 35))

Abstract

I had the distinct pleasure of meeting Dr. Susan Stepney in September 2006, on the occasion of the Fifth International Conference on Unconventional Computation (UC’06) held at the University of York in the United Kingdom. I learned a great deal at that conference co-chaired by Dr. Stepney, enough to motivate me to organize the sixth edition of that conference series the following year in Kingston, Ontario, Canada. This chapter relates my adventures in unconventional computation and natural computation, and offers some recollections on the path that led me to nonuniversality. It is dedicated to Susan in recognition of her contributions and in celebration of her 60th birthday.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Adamatzky, A., Akl, S.G.: Trans-Canada slimeways: slime mould imitates the Canadian transport network. Int. J. Nat. Comput. Res. 2, 31–46 (2011)

    Article  Google Scholar 

  2. Adamatzky, A., Akl, S.G.: Trans-Canada slimeways: from coast to coast to coast. In: Adamatzky, A. (ed.) Bioevaluation of World Transport Networks, pp. 113–125. World Scientific Publishing, London (2012)

    Chapter  Google Scholar 

  3. Adamatzky, A., Akl, S.G., Alonso-Sanz, R., Van Dessel, W., Ibrahim, Z., Ilachinski, A., Jones, J., Kayem, A.V.D.M., Martínez, G.J., De Oliveira, P., Prokopenko, M., Schubert, T., Sloot, P., Strano, E., Yang, X.S.: Biorationality of motorways. In: Adamatzky, A. (ed.) Bioevaluation of World Transport Networks, pp. 309–325. World Scientific Publishing, London (2012)

    Chapter  Google Scholar 

  4. Adamatzky, A., Akl, S.G., Alonso-Sanz, R., Van Dessel, W., Ibrahim, Z., Ilachinski, A., Jones, J., Kayem, A.V.D.M., Martínez, G.J., De Oliveira, P., Prokopenko, M., Schubert, T., Sloot, P., Strano, E., Yang, X.S.: Are motorways rational from slime mould’s point of view? Int. J. Parallel Emergent Distrib. Syst. 28, 230–248 (2013)

    Article  Google Scholar 

  5. Adamatzky, A., Akl, S.G., Burgin, M., Calude, C.S., Costa, J.F., Dehshibi, M.M., Gunji, Y.P., Konkoli, Z., MacLennan, B., Marchal, B., Margenstern, M., Martinez, G.J., Mayne, R., Morita, K., Schumann, A., Sergeyev, Y.D., Sirakoulis, G.C., Stepney, S., Svozil, K., Zenil, H.: East-west paths to unconventional computing. Prog. Biophys. Mol. Biol. Elsevier, Amsterdam (2017) (Special issue on Integral Biomathics: The Necessary Conjunction of the Western and Eastern Thought Traditions for Exploring the Nature of Mind and Life)

    Google Scholar 

  6. Akl, S.G.: Digital signatures with blindfolded arbitrators who cannot form alliances. In: Proceedings of 1982 IEEE Symposium on Security and Privacy, pp. 129–135. IEEE, Oakland (1982)

    Google Scholar 

  7. Akl, S.G.: Digital signatures: a tutorial survey. Computer 16, 15–24 (1983)

    Google Scholar 

  8. Akl, S.G.: On the security of compressed encodings. In: Chaum, D. (ed.) Advances in Cryptology, pp. 209–230. Plenum Press, New York (1984)

    Chapter  Google Scholar 

  9. Akl, S.G.: A prototype computer for the year 2000. Queen’s Gaz. 16, 325–332 (1984)

    Google Scholar 

  10. Akl, S.G.: Optimal parallel algorithms for selection, sorting and computing convex hulls. In: Toussaint, G.T. (ed.) Computational Geometry, pp. 1–22. North Holland, Amsterdam (1985)

    Google Scholar 

  11. Akl, S.G.: Parallel Sorting Algorithms. Academic Press, Orlando (1985)

    MATH  Google Scholar 

  12. Akl, S.G.: Checkers playing programs. In: Shapiro, S.C. (ed.) Encyclopedia of Artificial Intelligence, pp. 88–93. Wiley, New York (1987)

    Google Scholar 

  13. Akl, S.G.: The Design and Analysis of Parallel Algorithms. Prentice-Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  14. Akl, S.G.: Memory access in models of parallel computation: from folklore to synergy and beyond. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) Algorithms and Data Structures, pp. 92–104. Springer, Berlin (1991)

    Chapter  MATH  Google Scholar 

  15. Akl, S.G.: Parallel Computation: Models and Methods. Prentice Hall, Upper Saddle River (1997)

    Google Scholar 

  16. Akl, S.G.: Parallel real-time computation: sometimes quantity means quality. In: Sudborough, H., Monien, B., Hsu, D.F. (eds.) Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, pp. 2–11. IEEE, Dallas (2000)

    Google Scholar 

  17. Akl, S.G.: The design of efficient parallel algorithms. In: Blazewicz, J., Ecker, K., Plateau, B., Trystram, D. (eds.) Handbook on Parallel and Distributed Processing, pp. 13–91. Springer, Berlin (2000)

    Chapter  Google Scholar 

  18. Akl, S.G.: Parallel real-time computation of nonlinear feedback functions. Parallel Process. Lett. 13, 65–75 (2003)

    Article  MathSciNet  Google Scholar 

  19. Akl, S.G.: Superlinear performance in real-time parallel computation. J. Supercomput. 29, 89–111 (2004)

    Article  MATH  Google Scholar 

  20. Akl, S.G.: The myth of universal computation. In: Trobec, R., Zinterhof, P., Vajteršic, M., Uhl, A. (eds.) Parallel Numerics, pp. 211–236. University of Salzburg, Salzburg and Jozef Stefan Institute, Ljubljana (2005)

    Google Scholar 

  21. Akl, S.G.: Non-Universality in Computation: The Myth of the Universal Computer. Queen’s University, School of Computing (2005). http://research.cs.queensu.ca/Parallel/projects.html

  22. Akl, S.G.: A computational challenge. Queen’s University, School of Computing (2006). http://www.cs.queensu.ca/home/akl/CHALLENGE/A-Computational-Challenge.htm

  23. Akl, S.G.: Universality in computation: some quotes of interest. Technical Report No. 2006-511, School of Computing, Queen’s University (2006). http://www.cs.queensu.ca/home/akl/techreports/quotes.pdf

  24. Akl, S.G.: Conventional or unconventional: is any computer universal? In: Adamatzky, A., Teuscher, C. (eds.) From Utopian to Genuine Unconventional Computers, pp. 101–136. Luniver Press, Frome (2006)

    Google Scholar 

  25. Akl, S.G.: Three counterexamples to dispel the myth of the universal computer. Parallel Process. Lett. 16, 381–403 (2006)

    Article  MathSciNet  Google Scholar 

  26. Akl, S.G.: Even accelerating machines are not universal. Int. J. Unconv. Comput. 3, 105–121 (2007)

    Google Scholar 

  27. Akl, S.G.: Gödel’s incompleteness theorem and nonuniversality in computing. In: Nagy, M., Nagy, N. (eds.) Proceedings of the Workshop on Unconventional Computational Problems, pp. 1–23. Sixth International Conference on Unconventional Computation, Kingston (2007)

    Google Scholar 

  28. Akl, S.G.: Unconventional computational problems with consequences to universality. Int. J. Unconv. Comput. 4, 89–98 (2008)

    Google Scholar 

  29. Akl, S.G.: Evolving computational systems. In: Rajasekaran, S., Reif, J.H. (eds.) Parallel Computing: Models, Algorithms, and Applications, pp. 1–22. Taylor and Francis, Boca Raton (2008)

    Google Scholar 

  30. Akl, S.G.: Ubiquity and simultaneity: the science and philosophy of space and time in unconventional computation. Keynote address, Conference on the Science and Philosophy of Unconventional Computing, The University of Cambridge, Cambridge (2009)

    Google Scholar 

  31. Akl, S.G.: Time travel: A new hypercomputational paradigm. Int. J. Unconv. Comput. 6, 329–351 (2010)

    Google Scholar 

  32. Akl, S.G.: On the importance of being quantum. Parallel Process. Lett. 20, 275–286 (2010) (Special Issue on Advances in Quantum Computation. Qiu, K. (ed.))

    Google Scholar 

  33. Akl, S.G.: Bitonic sort. In: Padua, D. (ed.) Encyclopedia of Parallel Computing, pp. 139–146. Springer, New York (2011)

    Google Scholar 

  34. Akl, S.G.: What is computation? Int. J. Parallel Emergent Distrib. Syst. 29, 337–345 (2014)

    Article  Google Scholar 

  35. Akl, S.G.: Nonuniversality explained. Int. J. Parallel Emergent Distrib. Syst. 31, 201–219 (2016)

    Article  Google Scholar 

  36. Akl, S.G.: The quantum chess story. Int. J. Unconv. Comput. 12, 207–219 (2016)

    Google Scholar 

  37. Akl, S.G.: Nonuniversality in computation: fifteen misconceptions rectified. In: Adamatzky, A. (ed.) Advances in Unconventional Computing, pp. 1–30. Springer, Cham (2017)

    Google Scholar 

  38. Akl, S.G.: Unconventional computational problems. In: Meyers, R.A. (ed.) Encyclopedia of Complexity and Systems Science. Springer, New York (2017)

    Google Scholar 

  39. Akl, S.G.: Natures computes. Queen’s Alumni Rev. (2), 44 (2017)

    Google Scholar 

  40. Akl, S.G.: Information and computation: the essence of it all. Int. J. Unconv. Comput. 13, 187–194 (2017)

    Google Scholar 

  41. Akl, S.G.: Time: the final frontier. Int. J. Unconv. Comput. 13, 273–281 (2017)

    Google Scholar 

  42. Akl, S.G.: Computing shortest paths with cellular automata. J. Cell. Autom. 13, 33–52 (2018)

    MathSciNet  Google Scholar 

  43. Akl, S.G.: Unconventional wisdom: superlinear speedup and inherently parallel computations. Int. J. Unconv. Comput. 13, 283–307 (2018)

    Google Scholar 

  44. Akl, S.G.: How to encrypt a graph. Int. J. Parallel Emergent Distrib. Syst

    Google Scholar 

  45. Akl, S.G.: A computational journey in the true north. Int. J. Parallel Emergent Distrib. Syst. (Special Issue on A Half Century of Computing. Adamatzky, A.I., Watson, L.T. (eds.))

    Google Scholar 

  46. Akl, S.G. and Assem, I.: Fully homomorphic encryption: a general framework and implementations. Int. J. Parallel Emergent Distrib. Syst

    Google Scholar 

  47. Akl, S.G., Barnard, D.T., Doran, R.J.: Searching game trees in parallel. In: Proceedings of the Third Biennial Conference of the Canadian Society for Computational Studies of Intelligence, pp. 224–231. Victoria (1980)

    Google Scholar 

  48. Akl, S.G., Barnard, D.T., Doran, R.J.: Design, analysis and implementation of a parallel tree search algorithm. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-4, 192–203 (1982)

    Google Scholar 

  49. Akl, S.G., Cordy, B., Yao, W.: An analysis of the effect of parallelism in the control of dynamical systems. Int. J. Parallel Emergent Distrib. Syst. 20, 147–168 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  50. Akl, S.G., Denning, D.E.: Checking classification constraints for consistency and completeness. In: Proceedings of 1987 IEEE Symposium on Security and Privacy, pp. 196–201. IEEE, Oakland (1987)

    Google Scholar 

  51. Akl, S.G., Denning, D.E.: Checking classification constraints for consistency and completeness. In: Turn, R. (ed.) Advances in Computer System Security, vol. 3, pp. 271–276. Artech House, Norwood (1988)

    Google Scholar 

  52. Akl, S.G., Doran, R.J.: A comparison of parallel implementations of the alpha-beta and Scout tree search algorithms using the game of checkers. In: Bramer, M.A. (ed.) Computer Game Playing, pp. 290–303. Wiley, Chichester (1983)

    Google Scholar 

  53. Akl, S.G., Fava Lindon, L.: Paradigms for superunitary behavior in parallel computations. J. Parallel Algorithms Appl. 11, 129–153 (1997)

    Article  Google Scholar 

  54. Akl, S.G., Lindon, L.: Modèles de calcul parallèle à mémoire partagée. In: Cosnard, M., Nivat, M., Robert, Y. (eds.) Algorithmique Parallèle, pp. 15–29. Masson, Paris (1992)

    Google Scholar 

  55. Akl, S.G., Lyons, K.A.: Parallel Computational Geometry. Prentice Hall, Englewood Cliffs (1993)

    Google Scholar 

  56. Akl, S.G., Meijer, H.: A fast pseudo random permutation generator with applications to cryptology. In: Blakley, G.R., Chaum, D. (eds.) Advances in Cryptology. Lecture Notes in Computer Science, vol. 196, pp. 269–275. Springer, Berlin (1985)

    Chapter  Google Scholar 

  57. Akl, S.G., Meijer, H.: Two new secret key cryptosystems. In: Pichler, F. (ed.) Advances in Cryptology. Lecture Notes in Computer Science, vol. 219, pp. 96–102. Springer, Berlin (1986)

    Google Scholar 

  58. Akl, S.G., Nagy, M.: Introduction to parallel computation. In: Trobec, R., Vajteršic, M., Zinterhof, P. (eds.) Parallel Computing: Numerics, Applications, and Trends, pp. 43–80. Springer, London (2009)

    Chapter  Google Scholar 

  59. Akl, S.G., Nagy, M.: The future of parallel computation. In: Trobec, R., Vajteršic, M., Zinterhof, P. (eds.) Parallel Computing: Numerics, Applications, and Trends, pp. 471–510. Springer, London (2009)

    Chapter  Google Scholar 

  60. Akl, S.G., Newborn, M.M.: The principal continuation and the killer heuristic. In: Proceedings of the ACM Annual Conference, pp. 466–473. ACM, Seattle (1977)

    Google Scholar 

  61. Akl, S.G., Qiu, K.: Les réseaux d’interconnexion star et pancake. In: Cosnard, M., Nivat, M., Robert, Y. (eds.) Algorithmique Parallèle, pp. 171–181. Masson, Paris (1992)

    Google Scholar 

  62. Akl, S.G., Salay, N.: On computable numbers, nonuniversality, and the genuine power of parallelism. Int. J. Unconv. Comput. 11, 283–297 (2015)

    MATH  Google Scholar 

  63. Akl, S.G.: On computable numbers, nonuniversality, and the genuine power of parallelism. In: Adamatzky, A. (ed.) Emergent Computation: A Festschrift for Selim G. Akl, pp. 57–69. Springer, Cham (2017)

    Google Scholar 

  64. Akl, S.G., Stojmenović, I.: Generating combinatorial objects on a linear array of processors. In: Zomaya, A.Y. (ed.) Parallel Computing: Paradigms and Applications, pp. 639–670. International Thomson Computer Press, London (1996)

    Google Scholar 

  65. Akl, S.G., Stojmenović, I.: Broadcasting with selective reduction: a powerful model of parallel computation. In: Zomaya, A.Y. (ed.) Parallel and Distributed Computing Handbook, pp. 192–222. McGraw-Hill, New York (1996)

    Google Scholar 

  66. Akl, S.G., Taylor, P.D.: Cryptographic solution to a problem of access control in a hierarchy. ACM Trans. Comput. Syst. 1, 239–248 (1983)

    Article  Google Scholar 

  67. Akl, S.G., Toussaint, G.T.: A fast convex hull algorithm. Inf. Process. Lett. 7, 219–222 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  68. Akl, S.G., Yao, W.: Parallel computation and measurement uncertainty in nonlinear dynamical systems. J. Math. Model. Algorithms 4, 5–15 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  69. Bringsjord, S.: Is universal computation a myth? In: Adamatzky, A. (ed.) Emergent Computation: A Festschrift for Selim G. Akl, pp. 19–37. Springer, Cham (2017)

    Google Scholar 

  70. Choudhury, S., Salomaa, K., Akl, S.G.: A cellular automaton model for wireless sensor networks. J. Cell. Autom. 7, 223–242 (2012)

    MATH  Google Scholar 

  71. Choudhury, S., Salomaa, K., Akl, S.G.. A cellular automaton model for connectivity preserving deployment of mobile wireless sensors. In: Proceedings of the Second IEEE International Workshop on Smart Communication Protocols and Algorithms, pp. 6643–6647. IEEE, Ottawa (2012)

    Google Scholar 

  72. Choudhury, S., Salomaa, K., Akl, S.G.: Energy efficient cellular automaton based algorithms for mobile sensor networks. In: Proceedings of the 2012 IEEE Wireless Communications and Networking Conference, pp. 2341–2346. IEEE, Paris (2012)

    Google Scholar 

  73. Choudhury, S., Salomaa, K., Akl, S.G.: Cellular automaton based algorithms for the dispersion of mobile wireless sensor networks. Int. J. Parallel Emergent Distrib. Syst. 29, 147–177 (2014)

    Article  Google Scholar 

  74. Choudhury, S., Salomaa, K., Akl, S.G.: Cellular automaton based localized algorithms for mobile sensor networks. Int. J. Unconv. Comput. 11, 417–447 (2015)

    MATH  Google Scholar 

  75. Dadizadeh, A.: Two problems believed to exhibit superunitary behaviour turn out to fall within the church-turing thesis. M.Sc. Thesis, Bishop’s University, Canada (2018)

    Google Scholar 

  76. Denning, D.E., Akl, S.G., Heckman, M., Lunt, T.F., Morgenstern, M., Neumann, P.G., Schell, R.R.: Views for multilevel database security. IEEE Trans. Softw. Eng. SE-13, 129–140 (1987)

    Google Scholar 

  77. Deutsch, D.: The Fabric of Reality, p. 134. Penguin Books, London (1997)

    Google Scholar 

  78. Fraser, R., Akl, S.G.: Accelerating machines: a review. Int. J. Parallel Emergent Distrib. Syst. 23, 81–104 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  79. Kayem, A., Martin, P., Akl, S.G.: Adaptive Cryptographic Access Control. Springer, New York (2010)

    Book  MATH  Google Scholar 

  80. Kayem, A.V.D.M., Martin, P., Akl, S.G.: Self-protecting access control: on mitigating privacy violations with fault tolerance. In: Yee, G.O.M (ed) Privacy Protection Measures and Technologies in Business Organizations: Aspects and Standards, pp. 95–128. IGI Global, Hershey (2012)

    Google Scholar 

  81. MacKinnon, S., Taylor, P.D., Meijer, H., Akl, S.G.: An optimal algorithm for assigning cryptographic keys to control access in a hierarchy. IEEE Trans. Comput. C-34, 797–802 (1985)

    Google Scholar 

  82. McKay, C.D., Affleck, J.G., Nagy, N., Akl, S.G., Walker, V.K.: Molecular codebreaking and double encoding - Laboratory experiments. Int. J. Unconv. Comput. 5, 547–564 (2009)

    Google Scholar 

  83. Meijer, H., Akl, S.G.: Digital signature schemes. In: Proceedings of Crypto 81: First IEEE Workshop on Communications Security, pp. 65–70. IEEE, Santa Barbara (1981)

    Google Scholar 

  84. Meijer, H., Akl, S.G.: Digital signature schemes. Cryptologia 6, 329–338 (1982)

    Article  Google Scholar 

  85. Meijer, H., Akl, S.G.: Remarks on a digital signature scheme. Cryptologia 7, 183–186 (1983)

    Article  Google Scholar 

  86. Nagy, M., Akl, S.G.: On the importance of parallelism for quantum computation and the concept of a universal computer. In: Calude, C.S., Dinneen, M.J., Paun, G., Pérez-Jiménez, M., de, J., Rozenberg, G. (eds.) Unconventional Computation, pp. 176–190. Springer, Heildelberg (2005)

    Google Scholar 

  87. Nagy, M., Akl, S.G.: Quantum measurements and universal computation. Int. J. Unconv. Comput. 2, 73–88 (2006)

    Google Scholar 

  88. Nagy, M., Akl, S.G.: Quantum computing: beyond the limits of conventional computation. Int. J. Parallel Emergent Distrib. Syst. 22, 123–135 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  89. Nagy, M., Akl, S.G.: Parallelism in quantum information processing defeats the Universal Computer. Parallel Process. Lett. 17, 233–262 (2007) (Special Issue on Unconventional Computational Problems)

    Google Scholar 

  90. Nagy, M., Akl, S.G.: Coping with decoherence: parallelizing the quantum Fourier transform. Parallel Process. Lett. 20, 213–226 (2010) (Special Issue on Advances in Quantum Computation. Qiu, K. (ed.))

    Google Scholar 

  91. Nagy, M., Akl, S.G.: Entanglement verification with an application to quantum key distribution protocols. Parallel Process. Lett. 20, 227–237 (2010) (Special Issue on Advances in Quantum Computation. Qiu, K. (ed.))

    Google Scholar 

  92. Nagy, M., Akl, S.G., Kershaw, S.: Key distribution based on the quantum Fourier transform. Int. J. Secur. Appl. 3, 45–67 (2009)

    Google Scholar 

  93. Nagy, N., Akl, S.G.: Aspects of biomolecular computing. Parallel Process. Lett 17, 185–211 (2007)

    Article  MathSciNet  Google Scholar 

  94. Nagy, N., Akl, S.G.: Authenticated quantum key distribution without classical communication. Parallel Process. Lett. 17, 323–335 (2007) (Special Issue on Unconventional Computational Problems)

    Google Scholar 

  95. Nagy, N., Akl, S.G.: A quantum cryptographic solution to the problem of access control in a hierarchy. Parallel Process. Lett. 20, 251–261 (2010) (Special Issue on Advances in Quantum Computation. Qiu, K. (ed))

    Google Scholar 

  96. Nagy, N., Akl, S.G.: One-time pads without prior encounter. Parallel Process. Lett. 20, 263–273 (2010) (Special Issue on Advances in Quantum Computation. Qiu, K. (ed))

    Google Scholar 

  97. Nagy, N., Akl, S.G.: Computations with uncertain time constraints: effects on parallelism and universality. In: Calude, C.S., Kari, J., Petre, I., Rozenberg, G. (eds.) Unconventional Computation, pp. 152–163. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  98. Nagy, N., Akl, S.G.: Computing with uncertainty and its implications to universality. Int. J. Parallel Emergent Distrib. Syst. 27, 169–192 (2012)

    Article  Google Scholar 

  99. Nagy, N., Akl, S.G., Nagy, M.: Applications of Quantum Cryptography. Lambert Academic Publishing, Saarbrüken (2016)

    MATH  Google Scholar 

  100. Nagy, N., Nagy, M., Akl, S.G.: Key distribution versus key enhancement in quantum cryptography. Parallel Process. Lett. 20, 239–250 (2010) (Special Issue on Advances in Quantum Computation. Qiu, K. (ed.))

    Google Scholar 

  101. Nagy, N., Nagy, M., Akl, S.G.: Hypercomputation in a cryptographic setting: solving the identity theft problem using quantum memories. Int. J. Unconv. Comput. 6, 375–398 (2010)

    Google Scholar 

  102. Nagy, N., Nagy, M., Akl, S.G.: Quantum security in wireless sensor networks. Nat. Comput. 9, 819–830 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  103. Nagy, N., Nagy, M., Akl, S.G.: Carving secret messages out of public information. J. Comput. Sci. 11, 64–70 (2015)

    Article  Google Scholar 

  104. Nagy, N., Nagy, M., Akl, S.G.: A less known side of quantum cryptography. In: Adamatzky, A. (ed.) Emergent Computation: A Festschrift for Selim G. Akl, pp. 121–169. Springer, Cham (2017)

    Google Scholar 

  105. Palioudakis, A., Salomaa, K., Akl, S.G.: Unary NFAs, limited nondeterminism, and Chrobak normal form. Int. J. Unconv. Comput. 11, 395–416 (2015)

    Google Scholar 

  106. Palioudakis, A., Salomaa, K., Akl, S.G.: Operational state complexity of unary NFAs with finite nondeterminism. Theor. Comput. Sci. 610, 108–120 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  107. Palioudakis, A., Salomaa, K., Akl, S.G.: Worst case branching and other measures of nondeterminism. Int. J. Found. Comput. Sci. 28, 195–210 (2017)

    Article  MathSciNet  MATH  Google Scholar 

  108. Osiakwan, C.N.K., Akl, S.G.: A perfect speedup parallel algorithm for the assignment problem on complete weighted bipartite graphs. In: Rishe, N., Navathe, S., Tal, D. (eds.) Parallel Architectures, pp. 161–180. IEEE Computer Society Press, Los Alamitos (1991)

    Google Scholar 

  109. Pavel, S., Akl, S.G.: Matrix operations using arrays with reconfigurable optical buses. J. Parallel Algorithms Appl. 8, 223–242 (1996)

    Article  MATH  Google Scholar 

  110. Pavel, S., Akl, S.G.: Area-time trade-offs in arrays with optical pipelined buses. Appl. Opt. 35, 1827–1835 (1996)

    Article  Google Scholar 

  111. Pavel, S., Akl, S.G.: On the power of arrays with reconfigurable optical buses. In: Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, pp. 1443–1454. Sunnyvale, (1996)

    Google Scholar 

  112. Pavel, S., Akl, S.G.: Efficient algorithms for the Hough transform on arrays with reconfigurable optical buses. In: Proceedings of the International Parallel Processing Symposium, pp. 697–701. Maui (1996)

    Google Scholar 

  113. Pavel, S. and Akl, S.G.: Integer sorting and routing in arrays with reconfigurable optical buses. Int. J. of Found. of Comput. Sci. 9, 99–120 (1998) (Special Issue on Interconnection Networks)

    Google Scholar 

  114. Pavel, S.D., Akl, S.G.: Computing the Hough transform on arrays with reconfigurable optical buses. In: Li, K., Pan, Y., Zheng, S.-Q. (eds.) Parallel Computing Using Optical Interconnections, pp. 205–226. Kluwer Academic Publishers, Dordrecht (1998)

    Chapter  Google Scholar 

  115. Sipser, M.: Introduction to the Theory of Computation, p. 125. PWS, Boston (1997)

    MATH  Google Scholar 

  116. Taleb, N., Akl, S.G.: Error detection in asynchronous sequential circuits - the hardware approach. In: Proceedings of the Tenth Conference on Statistics and Scientific Computations, pp. S201–S215. Cairo University, Cairo (1974)

    Google Scholar 

  117. Torbey, S., Akl, S.G.: An exact and optimal local solution to the two-dimensional convex hull of arbitrary points problem. J. Cell. Autom. 4, 137–146 (2009)

    MathSciNet  MATH  Google Scholar 

  118. Torbey, S., Akl, S.G.: An exact solution to the two-dimensional arbitrary-threshold density classification problem. J. Cell. Autom. 4, 225–235 (2009)

    MathSciNet  MATH  Google Scholar 

  119. Torbey, S., Akl, S.G.: Reliable node placement in wireless sensor networks using cellular automata. In: Durand-Lose, J., Jonoska, N. (eds.) Unconventional Computation and Natural Computation, pp. 210–221. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  120. Torbey, S., Akl, S.G., Redfearn, D.: Time-scale analysis of signals without basis functions: application to sudden cardiac arrest prediction. Int. J. Unconv. Comput. 11, 375–394 (2015)

    Google Scholar 

  121. https://www.amazon.com/gp/richpub/listmania/fullview/32A3PMKCJH0Y8

  122. http://www.cs.queensu.ca/home/akl/QUANTUMCHESS/QCOnTheWeb.pdf

  123. http://www.nserc-crsng.gc.ca/Media-Media/ImpactStory-ArticlesPercutant_eng.asp?ID=1053

  124. https://www.youtube.com/watch?v=Hi0BzqV_b44

  125. http://research.cs.queensu.ca/home/akl/SLIMEMOLD/SlimeMoldInTheNews.pdf

Download references

Author information

Authors and Affiliations

  1. School of Computing, Queen’s University, Kingston, ON, K7L 3N6, Canada

    Selim G. Akl

Authors
  1. Selim G. Akl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Selim G. Akl .

Editor information

Editors and Affiliations

  1. Unconventional Computing Laboratory, University of the West of England, Bristol, UK

    Andrew Adamatzky

  2. Joint Quantum Centre, Durham University, Durham, UK

    Vivien Kendon

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Akl, S.G. (2020). From Parallelism to Nonuniversality: An Unconventional Trajectory. In: Adamatzky, A., Kendon, V. (eds) From Astrophysics to Unconventional Computation. Emergence, Complexity and Computation, vol 35. Springer, Cham. https://doi.org/10.1007/978-3-030-15792-0_6

Download citation

Publish with us

Policies and ethics

Search

Navigation