497
Views
7
CrossRef citations to date
0
Altmetric
Articles

What is computation?

Pages 337-345 | Received 12 Oct 2013, Accepted 12 Oct 2013, Published online: 05 Nov 2013

REFERENCES

  • A.Adamatzky and S.G.Akl, Trans-Canada slimeways: Slime mould imitates the Canadian transport network, Int. J. Nat. Comput. Res.2(4) (2011), pp. 31–46.
  • S.G.Akl, Parallel Computation: Models and Methods, Prentice Hall, Upper Saddle River, NJ, 1997.
  • S.G.Akl, Three counterexamples to dispel the myth of the universal computer, Parallel Process. Lett.16(3) (2006), pp. 381–403.
  • S.G.Akl, Even accelerating machines are not universal, Int. J. Unconventional Comput.3(2) (2007), pp. 105–121.
  • S.G.Akl, Evolving computational systems. Chapter 1, in Handbook of Parallel Computing: Models, Algorithms, and Applications, S.Rajasekaran and J.H.Reif, eds., Taylor and Francis/CRC Press, Boca Raton, FL, 2008, pp. 1–22.
  • S.G.Akl, Unconventional computational problems with consequences to universality, Int. J. Unconventional Comput.4(1) (2008), pp. 89–98.
  • S.G.Akl, Time travel: A new hypercomputational paradigm, Int. J. Unconventional Comput.6(5) (2010), pp. 329–351.
  • S.G. Akl, Nonuniversality in computation: Thirteen misconceptions rectified, Technical Report No. 2013-609, School of Computing, Queen's University, August 2013. Available at http:www.cs.queensu.cahomeakltechreportsthirteen.pdf.
  • P. Ball, Do plants act like computers?, Nature, January 1998. Available at http:www.nature.comnews1998040119fullnews040119-5.html.
  • A.Bhattacharyya, Morphogenesis as an amorphous computation, in Proceedings of the Third ACM Conference on Computing Frontiers, Ischia, ItalyMay 2006, pp. 53–64.
  • M.Burgin, Super-Recursive Algorithms, Springer, New York, 2005.
  • R.D.Cazé, M.Humphries, and B.Gutkin, Passive dendrites enable single neurons to compute linearly non-separable functions, PLoS Comput. Biol.9(2) (2013)
  • S. Connor, Revealed: Secret of how birds navigate during migration. The Independent, May 1, 2008. Available at http:www.independent.co.uknewssciencerevealed-secret-of-how-birds-navigate-during-migration-818766.html.
  • J.Copeland, Even Turing machines can compute uncomputable functions, in Unconventional Models of Computation, C.Calude, J.Casti, and M.Dinneen, eds., Springer-Verlag, Singapore, 1998, pp. 150–164.
  • E.B.Davies, Building infinite machines, Br. J. Philos. Sci.52 (2001), pp. 671–682.
  • M.Davis, The Universal Computer, W.W. Norton, New York, 2000.
  • L.N.De Castro, Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications, Chapman & Hall/CRC, New York, 2006.
  • P.J.Denning, Reflections on a Symposium on Computation, Ubiquity, ubiquity.acm.org; see also Comput. J.55(7) (2012), pp. 799–802.
  • D.Deutsch, The Fabric of Reality, Penguin Books, London, England, 1997.
  • J. Durand-Lose, Abstract geometrical computation for black hole computation, Research Report No. 2004-15, Laboratoire de l'Informatique du Parallélisme, École Normale Supérieure de Lyon, Lyon, France, April 2004.
  • H.B.Enderton, Elements of recursion theory, in Handbook of Mathematical Logic, J.Barwise, ed., North-Holland, Amsterdam, 1977, pp. 527–566.
  • L.Fortnow, The enduring legacy of the Turing machine, Comput. J.55(7) (2012), pp. 830–831.
  • R.Fraser and S.G.Akl, Accelerating machines: A review, Int. J. Parallel Emerg. Distrib. Syst.23(1) (2008), pp. 81–104.
  • J.Gleick, The Information: A History, a Theory, a Flood, HarperCollins, London, England, 2011.
  • D.Goldin and P.Wegner, The Church–Turing thesis: Breaking the myth, in Proceedings of the First International Conference on Computability in Europe: New Computational Paradigms, Springer-Verlag, Berlin, 2005, pp. 152–168.
  • J.L.Hein, Discrete Structures, Logic, and Computability, Jones and Bartlett, Subury, MA, 2010, p. 89.
  • K.Kelly, God is the machine, Wired10(12) (2002)
  • L.Kari and G.Rozenberg, The many facets of natural computing, Commun. ACM51(10) (2008), pp. 72–83.
  • H.R.Lewis and C.H.Papadimitriou, Elements of the Theory of Computation, Prentice Hall, Englewood Cliffs, NJ, 1981.
  • S.Lloyd, Programming the Universe, Knopf, New York, 2006.
  • M.Nagy and S.G.Akl, Quantum computing: Beyond the limits of conventional computation, Int. J. Parallel Emerg. Distrib. Syst. (Special Issue on Emergent Computation)22(2) (2007), pp. 123–135.
  • M.Nagy and S.G.Akl, Parallelism in quantum information processing defeats the Universal Computer, Parallel Process. Lett. (Special Issue on Unconventional Computational Problems)17(3) (2007), pp. 233–262.
  • N.Nagy and S.G.Akl, Computing with uncertainty and its implications to universality, Int. J. Parallel Emerg. Distrib. Syst.27(2) (2012), pp. 169–192.
  • J. Onuchic, Bacteria use chat to play the ‘prisoner's dilemma’ game in deciding their fate. Science Daily, March 2012. Available at http:www.sciencedaily.comreleases201203120327215704.htm.
  • Z.W.Pylyshyn, Computation and Cognition, MIT Press, Cambridge, MA, 1984.
  • H.Rogers, Jr, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
  • R.Rucker, The Lifebox, the Seashell, and the Soul, Thunder's Mouth Press, New York, 2005.
  • J.E.Savage, Models of Computation, Addison-Wesley, Reading, MA, 1998.
  • C.Seife, Decoding the Universe, Viking Penguin, New York, 2006.
  • T.Siegfried, The Bit and the Pendulum, John Wiley & Sons, Inc., New York, 2000.
  • M.Sipser, Introduction to the Theory of Computation, PWS Publishing Company, Boston, MA, 1997.
  • A.Syropoulos, Hypercomputation, Springer, New York, 2008.
  • F.J.Tipler, The Physics of Immortality: Modern Cosmology, God and the Resurrection of the Dead, Macmillan, London, England, 1995.
  • T.Toffoli, Physics and computation, Int. J. Theor. Phys.21 (1982), pp. 165–175.
  • A.M.Turing, On computable numbers with an application to the entscheidungsproblem, Proc. Lond. Math. Soc., Ser. 242 (1936), pp. 230–265; 43 (1937), pp. 544–546.
  • T.Van Gelder, What might cognition be, if not computation?J. Philos.92(7) (1995), pp. 345–381.
  • N. Van Hulst, Uncovering quantum secret in photosynthesis. Science Daily, June 2013. Available at http:www.sciencedaily.comreleases201306130620142932.htm.
  • J.Van Leeuwen and J.Wiedermann, The Turing machine paradigm in contemporary computing, in Mathematics Unlimited – 2001 and Beyond, B.Engquist and W.Schmidt, eds., Springer-Verlag, Berlin, 2000, pp. 1139–1156.
  • V.Vedral, Decoding Reality, Oxford University Press, Oxford, 2010.
  • J.A.Wheeler, At Home in the Universe, American Institute of Physics Press, Woodbury, NY, 1994.
  • N. Wolchover, A secret to animal migration believed unlocked at last. Science on NBC News, July 9, 2012. Available at http:www.nbcnews.comid48124812nstechnology_and_science-sciencetsecret-animal-migration-believed-unlocked-last.UgV5U20piM0.
  • S.Wolfram, A New Kind of Science, Wolfram Media, Champaign, IL, 2002.
  • K.Zuse, Calculating Space, MIT Technical Translation AZT-70-164-GEMIT, Massachusetts Institute of Technology (Project MAC), Cambridge, MA1970.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.