Advanced search
Publication Cover
Journal of Experimental & Theoretical Artificial Intelligence Volume 27, 2015 - Issue 1: Inforgs and the Infosphere: Themes from Luciano Floridi’s Philosophy of Artificial Intelligence
Submit an article Journal homepage
99
Views
0
CrossRef citations to date
0
Altmetric
Articles

‘Real’ information is not flat – and why it matters

S. Barry CooperSchool of Mathematics, University of Leeds, Leeds, UKCorrespondence[email protected]
Pages 3-11 | Received 15 Jul 2013, Accepted 15 Jul 2014, Published online: 24 Jul 2014

References

  • Alexander, S. (1927). Space, time, and deity. London: Macmillan & Co.
  • Barmpalias, G., Elwes, R., & Lewis-Pye, A. (2013, May 1). Digital morphogenesis via Schelling segregation, arXiv: 1302.4014v2.
  • Cooper, S. B. (2004). Computability theory. Boca Raton, FL: Chapman & Hall/CRC.
  • Cooper, S. B. (2012a). Incomputability after Alan Turing. Notices of the American Mathematical Society, 59776–59784.
  • Cooper, S. B. (2012b). Turing's Titanic machine?Communications of the ACM, 5574–5583.
  • Cooper, S. B. (2013). What makes a computation unconventional? In GordanaDodig-Crnkovic & RaffaellaGiovagnoli (Eds.), Computing nature: Turing centenary perspective, Studies in applied philosophy, epistemology and rational ethics (pp. 255–269). Heidelberg, New York, London: Springer.
  • Cooper, S. B., & Odifreddi, P. (2003). Incomputability in nature. In S. B.Cooper & S. S.Goncharov (Eds.), Computability and models (pp. 137–160). New York, NY: Kluwer Academic/Plenum.
  • Cooper, S. B., & van Leeuwen, J. (2013). Alan Turing: His work and impact. Heidelberg: Elsevier.
  • Damasio, A. R. (1999). The feeling of what happens: Body and emotion in the making of consciousness. New York, NY: Harcourt Brace.
  • Mardia, K. V., & Cooper, S. B. (2012). Alan Turing and enigmatic statistics. Bulletin of Brazil International Society for Bayesian Analysis [Boletim ISBrA], 5, 2–7.
  • Odifreddi, P. (1989/1999). Classical recursion theory (Vol. I and II). Amsterdam: North-Holland/Elsevier.
  • Post, E. L. (1994). Solvability, provability, definability: The collected works of Emil L. Post. (MartinDavis Ed.), Boston, MA: Birkhäuser.
  • Smolensky, P. (1988). On the proper treatment of connectionism. Behavioral and Brain Sciences, 11, 1–74.
  • Soare, R. I. (1987). Recursively enumerable sets and degrees. Berlin: Springer.
  • Turing, A. M. (1936/1937). On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42, 230–265. Reprinted in Turing, A.M. Collected Works: Mathematical Logic, 18–53.
  • Turing, A. M. (1939). Systems of logic based on ordinals. Proceedings of the London Mathematical Society, 45, 161–228. Reprinted in Turing, A.M. Collected Works: Mathematical Logic, 81–148.
  • Weinberg, S., (2002, October 24). Is the universe a computer? In The New York Review of Books. New York, NY: NYRB.

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:

Order Reprints Request Corporate Permissions

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:

Request Academic Permissions

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.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.