Linked bibliography for the SEP article "Information" by Pieter Adriaans

This is an automatically generated and experimental page

If everything goes well, this page should display the bibliography of the aforementioned article as it appears in the Stanford Encyclopedia of Philosophy, but with links added to PhilPapers records and Google Scholar for your convenience. Some bibliographies are not going to be represented correctly or fully up to date. In general, bibliographies of recent works are going to be much better linked than bibliographies of primary literature and older works. Entries with PhilPapers records have links on their titles. A green link indicates that the item is available online at least partially.

This experiment has been authorized by the editors of the Stanford Encyclopedia of Philosophy. The original article and bibliography can be found here.

  • Adriaans, P.W., 2007, ‘Learning as Data Compression’, in S. B. Cooper, B. Löwe & A. Sorbi, Computation and Logic in the Real World (Lecture Notes in Computer Science: Volume 449), Berlin: Springer, pp. 11–24. (Scholar)
  • –––, 2008, “Between Order and Chaos: The Quest for Meaningful Information,” Theory of Computing Systems (Special Issue: Computation and Logic in the Real World; Guest Editors: S. Barry Cooper, Elvira Mayordomo and Andrea Sorbi), 45 (July): 650–674. (Scholar)
  • Adriaans, P.W. and J.F.A.K. van Benthem, 2008a, ‘Information is what is does’, in Adriaans and van Benthem 2008b. (Scholar)
  • ––– (eds.), 2008b, Handbook of Philosophy of Information, Elsevier Science Publishers. (Scholar)
  • Adriaans, P. and P.M.B. Vitányi, 2009, “Approximation of the Two-Part MDL Code,” IEEE Transactions on Information Theory, 55(1): 444–457. (Scholar)
  • Aristotle. Aristotle in 23 Volumes, Vols. 17, 18, translated by Hugh Tredennick. Cambridge, MA, Harvard University Press; London, William Heinemann Ltd. 1933, 1989.
  • Antunes, L. and L. Fortnow, 2003, “Sophistication Revisited,” in Proceedings of the 30th International Colloquium on Automata, Languages and Programming (Lecture Notes in Computer Science: Volume 2719), Berlin: Springer, pp. 267–277. (Scholar)
  • Antunes, L., L. Fortnow, D. Van Melkebeek and N. V. Vinodch, 2006, “Computational depth: Concept and application,” Theoretical Computer Science, volume 354. (Scholar)
  • Aquinas, St. Thomas, 1265–1274, Summa Theologiae. (Scholar)
  • Arbuthnot, J., 1692, Of the Laws of Chance, or, a method of Calculation of the Hazards of Game, Plainly demonstrated, And applied to Games as present most in Use, translation of Huygens’ De Ratiociniis in Ludo Aleae, (Scholar)
  • Austen, J., 1815, Emma, London: Richard Bentley and Son. (Scholar)
  • Bar-Hillel, Y. and R. Carnap, 1953, ‘Semantic Information’, The British Journal for the Philosophy of Science, 4(14): 147–157. (Scholar)
  • Bais, F.A. and J.D. Farmer, 2008, “The Physics of Information,” in Adriaans and van Benthem 2008b. (Scholar)
  • Barron, A., J. Rissanen, and B. Yu, 1998, “The minimum description length principle in coding and modeling,” IEEE Transactions on Information Theory, 44(6): 2743–2760. (Scholar)
  • Barwise, J. and J. Perry, 1983, Situations and Attitudes, Cambridge, MA: MIT Press. (Scholar)
  • Bennett, C. H., 1988, “Logical depth and physical complexity,” in R. Herken (ed.), The Universal Turing Machine: A Half-Century Survey, Oxford: Oxford University Press, pp. 227–257. (Scholar)
  • van Benthem, J.F.A.K., 1990, “Kunstmatige Intelligentie: Een Voortzetting van de Filosofie met Andere Middelen,” Algemeen Nederlands Tijdschrift voor Wijsbegeerte, 82: 83–100. (Scholar)
  • –––, 2006, “Epistemic Logic and Epistemology: the state of their affairs,” Philosophical Studies, 128: 49–76. (Scholar)
  • van Benthem, J.F.A.K. and R. van Rooij, eds., 2003, “Connecting the Different Faces of Information,” Journal of Logic, Language and Information, 12(4): 375–379. (Scholar)
  • Berkeley, G., 1732, Alciphron: Or the Minute Philosopher, Edinburgh: Thomas Nelson, 1948–57. (Scholar)
  • Birkhoff, G.D., 1950, Collected Mathematical Papers, New York: American Mathematical Society. (Scholar)
  • Boole, G., 1847, Mathematical Analysis of Logic, Cambridge: Macmillan, Barclay, & Macmillan. [available online]. (Scholar)
  • Bovens, L. and S. Hartmann, 2003, Bayesian epistemology, Oxford: Oxford University Press. (Scholar)
  • Briggs, H., 1624, Arithmetica Logarithmica, London: Gulielmus Iones. (Scholar)
  • Capurro, R., 1978, Information. Ein Beitrag zur etymologischen und ideengeschichtlichen Begründung des Informationsbegriffs [Information: A contribution to the foundation of the concept of information based on its etymology and in the history of ideas]. Munich, Germany: Saur. [available online]. (Scholar)
  • –––, 2009, “Past, present and future of the concept of information,” tripleC (Cognition, Communication, Co-operation), 7(2): 125–141. (Scholar)
  • Capurro, R. & B. Hjørland, 2003, “The Concept of Information,” in Blaise Cronin (ed.), Annual Review of Information Science and Technology (ARIST), 37 (Chapter 8), 343–411. (Scholar)
  • Carnap, R., 1928, Scheinprobleme in der Philosophie (Pseudoproblems of Philosophy). Berlin: Weltkreis-Verlag. (Scholar)
  • –––, 1945, “The Two Concepts of Probability: The Problem of Probability,” Philosophy and Phenomenological Research, 5(4): 513–532. (Scholar)
  • –––, 1947, Meaning and Necessity, Chicago: The University of Chicago Press. (Scholar)
  • –––, 1950, Logical Foundations of Probability, Chicago: The University of Chicago Press. (Scholar)
  • Chaitin, G. J., 1969, “On the length of programs for computing finite binary sequences: statistical considerations,” J. Assoc. Comput. Mach., 16: 145–159. (Scholar)
  • –––, 1987, Algorithmic information theory, New York: Cambridge University Press. (Scholar)
  • Chater, N. and P.M.B. Vitányi, 2003, “Simplicity: a unifying principle in cognitive science,” Trends in Cognitive Science, 7(1): 19–22. (Scholar)
  • Cilibrasi, R. and P.M.B. Vitányi, 2005, “Clustering by compression,” IEEE Transactions on Information Theory, 51(4), 1523–1545. (Scholar)
  • Clausius, R., 1850, “Über die bewegende Kraft der Wärme und die Gesetze welche sich daraus für die Wärmelehre selbst ableiten lassen,” Poggendorffs Annalen der Physik und Chemie, 79: 368–97. (Scholar)
  • Conan Doyle, A., 1892, The Adventures of Sherlock Holmes, George Newnes Ltd. (Scholar)
  • Cover, T.M. and J.A. Thomas, 2006, Elements of Information Theory, 2nd edition, New York: John Wiley & Sons. (Scholar)
  • Crawford, J.M. and L.D. Auton, 1993, “Experimental Results on the Cross over Point in Satisfiability Problems,” Proceedings of the Eleventh National Conference on Artificial Intelligence, AAAI Press, pp. 21–27. (Scholar)
  • Crutchfield, J.P. and K. Young, 1989, “Inferring Statistical Complexity,” Physical Review Letters, 63:105. (Scholar)
  • –––, 1990, “Computation at the Onset of Chaos,” in Entropy, Complexity, and the Physics of Information, W. Zurek, editor, SFI Studies in the Sciences of Complexity, VIII, Reading, MA: Addison-Wesley, pp. 223–269. (Scholar)
  • Defoe, D., 1719, The Life and Strange Surprising Adventures of Robinson Crusoe of York, Mariner: who lived Eight and Twenty Years, all alone in an uninhabited Island on the coast of America, near the Mouth of the Great River of Oroonoque; Having been cast on Shore by Shipwreck, wherein all the Men perished but himself. With An Account how he was at last as strangely deliver'd by Pirates. Written by Himself, London: W. Taylor. (Scholar)
  • Dershowitz, N. and Y. Gurevich, 2008, “A Natural Axiomatization of Computability and Proof of Church's Thesis,” Bulletin of Symbolic Logic, 14(3): 299–350. (Scholar)
  • Descartes, R., 1641, Meditationes de Prima Philosophia (Meditations on First Philosophy), Paris. (Scholar)
  • –––, 1647, Discours de la Méthode (Discourse on Method), Leiden. (Scholar)
  • Devlin, K. and D. Rosenberg, 2008, “Information in the Study of Human Interaction,” in Adriaans and van Benthem 2008b. (Scholar)
  • Dictionnaire du Moyen Français (1330–1500) 2010, [available online]
  • Domingos, P., 1998, “Occam's Two Razors: The Sharp and the Blunt,” in Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD–98), New York: AAAI Press, pp. 37–43. (Scholar)
  • Downey, R.G. and D.R. Hirschfeldt, 2010, Algorithmic Randomness and Complexity (Series: Theory and Applications of Computability), New York: Springer. (Scholar)
  • Dretske, F., 1981, Knowledge and the Flow of Information, Cambridge, MA: The MIT Press. (Scholar)
  • Dufort, P.A. and C.J. Lumsden, 1994, “The Complexity and Entropy of Turing Machines,” Workshop on Physics and Computation. PhysComp '94 Proceedings, 227–232. (Scholar)
  • Dunn, J.M., 2001, “The Concept of Information and the Development of Modern Logic,” in Non-classical Approaches in the Transition from Traditional to Modern Logic, W. Stelzner (ed.), de Gruyter, pp. 423–427. (Scholar)
  • –––, 2008, “Information in computer science,” in Adriaans and van Benthem 2008b. (Scholar)
  • Dijksterhuis, E. J., 1986, The Mechanization of the World Picture: Pythagoras to Newton, Princeton University Press. (Scholar)
  • Duns Sotus, Opera Omnia. ("The Wadding edition") Lyon, 1639; reprinted Hildesheim: Georg Olms Verlagsbuchhandlung, 1968. (Scholar)
  • Edwards, P., 1967, The Encyclopedia of Philosophy, Macmillan Publishing Company. (Scholar)
  • Fisher, R.A., 1925, “Theory of statistical estimation,” Proceedings Cambridge Philosophical Society, 22(5): 700–725. (Scholar)
  • Floridi, L., 1999, “Information Ethics: On the Theoretical Foundations of Computer Ethics,” Ethics and Information Technology, 1(1): 37–56. (Scholar)
  • –––, 2002, “What Is the Philosophy of Information?Metaphilosophy, 33(1–2): 123–145. (Scholar)
  • –––, ed., 2003, The Blackwell Guide to the Philosophy of Computing and Information, Blackwell, Oxford. (Scholar)
  • –––, 2011, The Philosophy of Information, Oxford University Press. (Scholar)
  • Frege, G., 1879, Begriffsschrift: eine der arithmetischen nachgebildete Formelsprache des reinen Denkens, Halle. (Scholar)
  • –––, 1892, Über Sinn und Bedeutung Zeitschrift für Philosophie und philosophische Kritik, NF 100. (Scholar)
  • Galileo Galilei, 1623, Il Saggiatore (in Italian) (Rome); The Assayer, English trans. Stillman Drake and C. D. O'Malley, in The Controversy on the Comets of 1618 (University of Pennsylvania Press, 1960). (Scholar)
  • Garey, M.R. and D.S.Johnson, 1979, Computers and Intractability, W.H.Freeman & Co. (Scholar)
  • Gell-Mann, M. and S. Lloyd, 2003, “Effective Complexity,” Working papers Santa Fe Institute, 387–398. (Scholar)
  • Gibbs, J.W., 1906, The scientific papers of J. Willard Gibbs in Two Volumes, 1. Longmans, Green, and Co. (Scholar)
  • Godefroy, F.G., 1881, Dictionnaire de l'ancienne langue française et de tous ses dialectes du 9e au 15e siècle, Paris F. Vieweg. (Scholar)
  • Grünwald, P.D., 2007, The Minimum Description Length Principle, MIT Press. (Scholar)
  • Grünwald, P. and P.M.B. Vitányi, 2008, “Algorithmic Information Theory,” in Adriaans and van Benthem 2008b. (Scholar)
  • Harremoës, P. and F. Topsøe, 2008, “The quantitative theory of information,” in Adriaans and van Benthem 2008b. (Scholar)
  • Hazard, P., 1935, La Crise de la conscience européenne, Paris. (Scholar)
  • Hintikka, J., 1962, Knowledge and Belief, Cornel University Press, Ithaca. (Scholar)
  • –––, 1973, Logic, Language Games, and Information, Clarendon, Oxford. (Scholar)
  • Hume, D., 1739–40, A Treatise of Human Nature. (Scholar)
  • –––, 1748, An Enquiry concerning Human Understanding, P.F. Collier & Son. 1910, ISBN 0198250606. [available online] (Scholar)
  • Hutter, M., 2005, Universal Artificial Intelligence: Sequential Decisions based on Algorithmic Probability, EATCS Book, Berlin: Springer. (Scholar)
  • –––, 2007a, “On Universal Prediction and Bayesian Confirmation,” Theoretical Computer Science, 384(1): 33–48. (Scholar)
  • ––– 2007b, “Algorithmic Information Theory: a brief non-technical guide to the field,” Scholarpedia, 2(3): 2519. (Scholar)
  • –––, 2010, “A Complete Theory of Everything (will be subjective),” Algorithms, 3(4): 329–350. (Scholar)
  • Ibn Tufail, Hayy ibn Yaqdhan, translated as Philosophus Autodidactus, published by Edward Pococke the Younger in 1671.
  • Kahn, D., 1967, The Code-Breakers, The Comprehensive History of Secret Communication from Ancient Times to the Internet, New York: Scribner. (Scholar)
  • Kolmogorov, A.N., 1965, “Three Approaches to the Quantitative Definition of Information,” Problems Inform. Transmission, 1(1): 1–7. (Scholar)
  • Koppel, M., 1987, “Complexity, Depth, and Sophistication,” in Complex Systems, 1(6): 1087–1091. (Scholar)
  • Kripke, S.A., 1959, “A Completeness Theorem in Modal Logic,” The Journal of Symbolic Logic, 24(1): 1–14. (Scholar)
  • Kuipers, Th.A.F. (ed.), 2007a, General Philosophy of Science, Amsterdam: Elsevier Science Publishers. (Scholar)
  • Kuipers, Th.A.F., 2007b, “Explanation in Philosophy of Science,” in Kuipers 2007a. (Scholar)
  • Langton, C.G., 1990, “Computation at the edge of chaos: Phase Transitions and Emergent Computation,” Physica D, 42(1–3): 12–37. (Scholar)
  • Lenski, W., 2010, “Information: a conceptual investigation,” Information 2010, 1(2): 74–118. (Scholar)
  • Levin, L.A., 1974, “Laws of information conservation (non-growth) and aspects of the foundation of probability theory,” Problems Information Transmission, 10(3): 206–210. (Scholar)
  • Li, M. and P.M.B. Vitányi, 2008, An introduction to Kolmogorov complexity and its applications, Berlin: Springer-Verlag, third edition. (Scholar)
  • Lloyd, S. and J. Ng, 2004, “Black Hole Computers,” Scientific American, 291(5): 30–39. (Scholar)
  • Locke, J., 1689, An Essay Concerning Human Understanding, J. W. Yolton (ed.), London: Dent; New York: Dutton, 1961. (Scholar)
  • Mill, J.S., 1843, A System of Logic, London. (Scholar)
  • Napier, J., 1614, Mirifici Logarithmorum Canonis Descriptio, Edinburgh: Andre Hart. [translation available online]. (Scholar)
  • Von Neumann, J., 1955, Mathematische Grundlagen der Quantenmechanik, Berlin: Springer. (Scholar)
  • Nielsen, M.A. and I.L. Chuang, 2000, Quantum Computation and Quantum Information, Cambridge: Cambridge University Press. (Scholar)
  • Niess, A., 2009, Computability and Randomness (Oxford Logic Guides 51), Oxford: Oxford University Press. (Scholar)
  • Ong, W. J., 1958, 2004, Ramus, Method, and the Decay of Dialogue, From the Art of Discourse to the Art of Reason, Chicago: University of Chicago Press. (Scholar)
  • Parikh, R. and R. Ramanujam, 2003, “A Knowledge Based Semantics of Messages,” Journal of Logic, Language and Information, 12: 453–467. (Scholar)
  • Peirce, C. S., 1868, “Upon Logical Comprehension and Extension,” Proceedings of the American Academy of Arts and Sciences, 7: 416–432. (Scholar)
  • –––, 1886, Letter, Peirce to A. Marquand, dated 1886, W 5:541–3, Google Preview. See Burks, Arthur W., Review: Charles S. Peirce, The new elements of mathematics, Bulletin of the American Mathematical Society, 84(5) (1978): 913–18. (Scholar)
  • van Peursen, C.A., 1987, “Christian Wolff's Philosophy of Contingent Reality,” Journal of the History of Philosophy, 25(1): 69–82 (Scholar)
  • Popper, K., 1934, The Logic of Scientific Discovery, (Logik der Forschung), English translation 1959, London: Hutchison, 1977). (Scholar)
  • Putnam, H., 1988, Representation and reality, Cambridge: The MIT Press. (Scholar)
  • Quine, W.V.O., 1951, “Two Dogmas of Empiricism,” The Philosophical Review, 60: 20–43. Reprinted in his 1953 From a Logical Point of View, Harvard University Press. (Scholar)
  • Rathmanner, S. and M. Hutter, 2011, “A Philosophical Treatise on Universal Induction,” Entropy, 13(6): 1076–1136. (Scholar)
  • Redei, M. and M. Stoeltzner, eds., 2001, John von Neumann and the Foundations of Quantum Physics, Dordrecht: Kluwer Academic Publishers. (Scholar)
  • Rissanen, J.J., 1978, “Modeling by Shortest Data Description,” Automatica, 14(5): 465–471. (Scholar)
  • –––, 1989, Stochastic Complexity in Statistical Inquiry, World Scientific Series in Computer Science, 15, Singapore: World Scientific. (Scholar)
  • van Rooij, R., 2004, “Signalling games select Horn strategies,” Linguistics and Philosophy, 27: 493–527. (Scholar)
  • Schmidhuber, J. 1997a, “Low-Complexity Art,” Leonardo, Journal of the International Society for the Arts, Sciences, and Technology, 30(2): 97–103, MIT Press. (Scholar)
  • –––, 1997b, “A Computer Scientist's View of Life, the Universe, and Everything,” Lecture Notes in Computer Science, 1337: 201–208. (Scholar)
  • Schnelle, H., 1976, “Information,” in J. Ritter (ed.), Historisches Wörterbuch der Philosophie, IV [Historical dictionary of philosophy, IV] (pp. 116–117). Stuttgart, Germany: Schwabe. (Scholar)
  • Searle, J.R., 1990, “Is the Brain a Digital Computer?Proceedings and Addresses of the American Philosophical Association, 64: 21–37. (Scholar)
  • Seiffert, H., 1968, Information über die Information [Information about information] Munich: Beck. (Scholar)
  • Shannon, C. 1948, “A Mathematical Theory of Communication,” Bell System Technical Journal, 27: 379–423, 623–656. (Scholar)
  • Shannon, C. E. and W. Weaver, 1949, The Mathematical Theory of Communication, Urbana: University of Illinois Press. (Scholar)
  • Simon, J.C. and Olivier Dubois, 1989, “Number of Solutions of Satisfiability Instance—Applications to Knowledge Bases,” International Journal of Pattern Recognition and Artificial Intelligence (IJPRAI), 3(1):53–65. (Scholar)
  • Singh, S., 1999, The Code Book: The Science of Secrecy from Ancient Egypt to Quantum Cryptography, New York: Anchor Books. (Scholar)
  • Solomonoff, R.J., 1960, “A preliminary report on a general theory of inductive inference,” Techical Report ZTB-138, Zator.
  • –––, 1964a, “A Formal Theory of Inductive Inference Part I,” Information and Control, 7(1): 1–22. (Scholar)
  • –––, 1964b, “A Formal Theory of Inductive Inference Part II,” Information and Control, 7(2): 224–254. (Scholar)
  • –––, 1997, “The Discovery of Algorithmic Probability,” Journal of Computer and System Sciences, 55(1): 73–88. (Scholar)
  • Stalnaker, R., 1984, Inquiry, Cambridge, MA: MIT Press. (Scholar)
  • Stifel, M. 1544, Arithmetica integra, Nuremberg: Johan Petreium. (Scholar)
  • Tarski, A. 1944, “The Semantic Conception of Truth,” Philosophy and Phenomenological Research, 4: 13–47. (Scholar)
  • Valiant, L. G., 2007, “Evolvability,” Journal of the ACM, 56(1): Article 3. (Scholar)
  • Vereshchagin, N.K. and P.M.B. Vitányi, 2004, “Kolmogorov's Structure functions and model selection,” IEEE Transactions on Information Theory, 50(12): 3265–3290. (Scholar)
  • Vitányi, P.M.B., 2006, “Meaningful information,” IEEE Transactions on Information Theory, 52(10): 4617–4626. [available online]. (Scholar)
  • de Vogel, C.J., 1974, Plato: De filosoof van het transcendente, Baarn: Het Wereldvenster, 1968. (Scholar)
  • Wallace, C. S., 2005, Statistical and Inductive Inference by Minimum Message Length, Springer, Berlin. (Scholar)
  • Wheeler, J. A., 1990, “Information, physics, quantum: The search for links,” in W. Zurek (ed.) Complexity, Entropy, and the Physics of Information, Redwood City, CA: Addison-Wesley. (Scholar)
  • Windelband, W., 1921, Lehrbuch der Geschichte der Philosophie, Tübingen. (Scholar)
  • Wolff, J.G., 2006, Unifying Computing and Cognition, CognitionResearch.org.uk. (Scholar)
  • Wolfram, S., 2002, A New Kind of Science, Wolfram Media Inc. (Scholar)
  • Wolpert, D.H. and W. Macready, 2007, “Using self-dissimilarity to quantify complexity,” Complexity, 12(3): 77–85. (Scholar)
  • Zuse, K., 1969, Rechnender Raum, Friedrich Vieweg & Sohn, Braunschweig. Translated as “Calculating Space” MIT Technical Translation AZT-70-164-GEMIT, MIT (Proj. MAC), Cambridge, MA, Feb. 1970. (Scholar)

Generated Wed Mar 22 16:31:27 2017