pith. sign in

arxiv: 2512.11279 · v4 · submitted 2025-12-12 · 💻 cs.IT · math.IT

The Universal Language of Mathematics (Introduction to Binary Principle)

Bruno Macchiavello This is my paper

Pith reviewed 2026-05-16 23:28 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords binary principleuniversal languageinformation theorymathematics foundationszero and oneabsence and presenceshannon
0
0 comments X

The pith

Mathematics is built from the distinction between absence and presence using zero and one.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The book argues that mathematics functions as a universal language rooted in the binary principle. Zero and one serve as the primitive units of absence and presence, from which all complex theories, numbers, symbols, and applications develop. This view draws on information theory to contrast math's precision with natural language and aims to make the subject more intuitive for teaching and understanding. A sympathetic reader would care because it offers a foundation that reveals how structures in science and technology arise from the simplest distinctions. The narrative positions this binary approach as the core that transforms how mathematics is seen and learned.

Core claim

At the heart of the work lies the Binary Principle -- the idea that zero and one are not merely digits, but primitive building blocks of all mathematical reasoning. By treating absence and presence as fundamental units, the book reveals how complex theories and applications emerge from the simplest distinctions. This perspective makes mathematics more intuitive, more engaging, and more accessible, transforming how it can be taught and understood.

What carries the argument

The Binary Principle, which treats zero and one as primitive units representing absence and presence from which all mathematical reasoning develops.

Load-bearing premise

That treating absence and presence as fundamental units is sufficient to derive or reveal how complex theories emerge without additional structure or prior mathematical machinery.

What would settle it

A demonstration of a specific mathematical concept or theorem that cannot be constructed or explained using only distinctions of absence and presence would disprove the central claim.

Figures

Figures reproduced from arXiv: 2512.11279 by Bruno Macchiavello.

Figure 2.1
Figure 2.1. Figure 2.1: Graphical representation of the union of two sets [PITH_FULL_IMAGE:figures/full_fig_p021_2_1.png] view at source ↗
Figure 2.2
Figure 2.2. Figure 2.2: 5 [PITH_FULL_IMAGE:figures/full_fig_p021_2_2.png] view at source ↗
Figure 2.2
Figure 2.2. Figure 2.2: A graphical representation of B as a subset of A. 2.2.6 Axiom of Infinity Informal:“ There is a inductive set.” This axioms help create sets with a infinite collection of elements. Formal: ∃A  ∅ ∈ A ∧ ∀x ∈ A (x ∪ {x} ∈ A)  Note: It will be use in order to create the set of the natural numbers in section 2.4. 2.2.7 Axiom Schema of Separation Informal: “From any set, you can carve out a smaller set by ke… view at source ↗
Figure 2.3
Figure 2.3. Figure 2.3: A graphical representation of the intersection of two sets ( [PITH_FULL_IMAGE:figures/full_fig_p023_2_3.png] view at source ↗
Figure 2.4
Figure 2.4. Figure 2.4: Representation of a function f : A → B as a mapping between sets. Each element of A is associated with exactly one element of B, satis￾fying the definition of a function in set theory. In this example, two distinct elements of A map to the same element of B, which illustrates a valid func￾tion that is not injective and therefore not invertible. This visualization highlights the limits of invertibility an… view at source ↗
Figure 3.1
Figure 3.1. Figure 3.1: A visual description comparing Lebesque Integral to Reimann [PITH_FULL_IMAGE:figures/full_fig_p051_3_1.png] view at source ↗
Figure 4
Figure 4. Figure 4: shows a graphical representration of this relationships using Venn [PITH_FULL_IMAGE:figures/full_fig_p057_4.png] view at source ↗
Figure 4.1
Figure 4.1. Figure 4.1: The rectangle Ω is the sample space: all possible outcomes. The circles (A and B) are events: subsets of Ω. The union (A ∪ B) is shaded to represent “A or B happens”. The intersection (A ∩ B) is the overlap: “A and B happen together”. The complement Ac is everything outside circle A, meaning “A is not happening”. The empty set (∅) represents “no outcome”, which always has probability 0 (not possible to r… view at source ↗
read the original abstract

This book invites readers to see mathematics not just as formulas and rules, but as the deepest expression of human thought. It begins by exploring the timeless idea of mathematics as a universal language, contrasting its precision with the richness of natural speech. From the foundations of pure and applied mathematics to the revolutionary insights of Claude Shannon's information theory, the narrative shows how numbers, symbols, and structures have shaped science, technology, and communication. At the heart of the work lies the Binary Principle -- the idea that zero and one are not merely digits, but primitive building blocks of all mathematical reasoning. By treating absence and presence as fundamental units, the book reveals how complex theories and applications emerge from the simplest distinctions. This perspective makes mathematics more intuitive, more engaging, and more accessible, transforming how it can be taught and understood. Discover the Binary Principle: Mathematics as the True Universal Language. This book invites readers to see mathematics not just as formulas and rules, but as the deepest expression of human thought.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The manuscript introduces the Binary Principle as the foundational idea that zero and one represent primitive units of absence and presence from which all mathematical reasoning and complex structures emerge. It frames mathematics as the universal language, contrasting its precision with natural language, and references information theory (Shannon) while positioning the Binary Principle as making mathematics more intuitive and accessible for teaching and understanding.

Significance. If substantiated, the perspective could offer an accessible entry point to mathematical ideas for non-specialists and potentially influence pedagogy. However, the manuscript supplies no derivations, axioms, examples, or technical results, so it does not advance information theory or provide falsifiable claims; its value remains philosophical and expository rather than contributing new technical insight.

major comments (2)
  1. [Abstract] Abstract and opening narrative: the central claim that 'complex theories and applications emerge from the simplest distinctions' of absence and presence is asserted without any supporting construction, derivation, or concrete example (e.g., no step-by-step emergence of arithmetic, logic, or Shannon entropy is shown). This renders the claim untestable within the manuscript.
  2. [Introduction] No section supplies formal definitions or axioms for the Binary Principle; it is introduced simultaneously as premise and conclusion, creating an unsupported circular framing with no independent grounding or comparison to standard foundations such as Peano arithmetic or Boolean algebra.
minor comments (1)
  1. [Title/Abstract] The title and abstract use 'book' language ('This book invites readers') while the arXiv category is cs.IT; clarify whether this is intended as a monograph or research article.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their constructive comments on our manuscript. We acknowledge that the work is primarily philosophical and expository, aiming to introduce the Binary Principle as an intuitive perspective on mathematics rather than providing new technical derivations in information theory. Below, we address the major comments point by point, indicating where revisions will be made to strengthen the presentation.

read point-by-point responses

  1. Referee: [Abstract] Abstract and opening narrative: the central claim that 'complex theories and applications emerge from the simplest distinctions' of absence and presence is asserted without any supporting construction, derivation, or concrete example (e.g., no step-by-step emergence of arithmetic, logic, or Shannon entropy is shown). This renders the claim untestable within the manuscript.

    Authors: We agree that the manuscript does not include formal derivations or step-by-step constructions, as its purpose is to provide an accessible narrative introduction rather than a technical treatise. The Binary Principle is offered as a conceptual framework that builds upon established ideas in information theory, such as Shannon's binary digits. To address this, we will add a new section with concrete examples illustrating how binary distinctions lead to basic arithmetic and logical structures, making the emergence more explicit. revision: yes

  2. Referee: [Introduction] No section supplies formal definitions or axioms for the Binary Principle; it is introduced simultaneously as premise and conclusion, creating an unsupported circular framing with no independent grounding or comparison to standard foundations such as Peano arithmetic or Boolean algebra.

    Authors: The Binary Principle is not proposed as a new foundational axiomatic system to replace existing ones like Peano arithmetic or Boolean algebra. Instead, it serves as a unifying philosophical perspective that highlights the role of binary distinctions across mathematical domains. We will revise the introduction to explicitly state this and include a brief comparison to standard foundations, clarifying that it complements rather than supplants them, thereby avoiding any appearance of circularity. revision: yes

Circularity Check

0 steps flagged

Expository introduction with no technical derivation chain

full rationale

The manuscript is presented as a philosophical and narrative introduction to the Binary Principle rather than a formal derivation. No equations, axioms, step-by-step constructions, fitted parameters, or load-bearing self-citations appear in the abstract or described text. The central perspective—that absence and presence as units reveal complex theories—is stated directly without reduction to prior inputs or definitional loops. Because no derivation chain exists, none of the enumerated circularity patterns can be exhibited.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 1 invented entities

The work rests on the unproven assertion that binary distinctions alone suffice as the origin of all mathematical reasoning, with no independent evidence or derivations supplied.

axioms (1)
  • domain assumption Mathematics is the deepest expression of human thought and can be reduced to binary distinctions of presence and absence.
    Invoked in the abstract as the core perspective without further justification.
invented entities (1)
  • Binary Principle no independent evidence
    purpose: To serve as the universal foundation explaining emergence of complex mathematical theories from zero and one.
    Introduced as a new organizing idea but without falsifiable predictions or external validation.

pith-pipeline@v0.9.0 · 5460 in / 1136 out tokens · 31551 ms · 2026-05-16T23:28:11.687348+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

66 extracted references · 66 canonical work pages

  1. [1]

    On computable numbers, with an application to the entscheidungsproblem,

    A. M. Turing, “On computable numbers, with an application to the entscheidungsproblem,”Proceedings of the London Mathematical Soci- ety, vol. 2, no. 42, pp. 230–265, 1936

    work page 1936

  2. [2]

    Computing machinery and intelligence,

    ——, “Computing machinery and intelligence,”Mind, vol. 59, no. 236, pp. 433–460, 1950

    work page 1950

  3. [3]

    Fourier,Théorie analytique de la chaleur

    J. Fourier,Théorie analytique de la chaleur. Chez Firmin Didot, Paris, 1822

    work page

  4. [4]

    von Neumann and O

    J. von Neumann and O. Morgenstern,Theory of Games and Economic Behavior. Princeton University Press, 1944

    work page 1944

  5. [5]

    Amathematicaltheoryofcommunication,

    C.E.Shannon, “Amathematicaltheoryofcommunication,”Bell System Technical Journal, vol. 27, pp. 379–423, 623–656, 1948

    work page 1948

  6. [6]

    Shannon , title =

    C. Shannon, “Communication in the presence of noise,”Proceedings of the IRE, vol. 37, no. 1, pp. 10–21, jan 1949. [Online]. Available: https://doi.org/10.1109/jrproc.1949.232969

    work page doi:10.1109/jrproc.1949.232969 1949

  7. [7]

    C. E. Shannon and W. Weaver,The Mathematical Theory of Commu- nication. University of Illinois Press, 1949

    work page 1949

  8. [8]

    Über eine eigenschaft des inbegriffes aller reellen alge- braischen zahlen,

    G. Cantor, “Über eine eigenschaft des inbegriffes aller reellen alge- braischen zahlen,”Journal für die reine und angewandte Mathematik (Crelle’s Journal), vol. 77, pp. 258–262, 1874, note: Introduces funda- mental concepts of sets and the study of infinite cardinalities, marking the origin of set theory

    work page

  9. [9]

    Beweis, dass jede menge wohlgeordnet werden kann,

    E. Zermelo, “Beweis, dass jede menge wohlgeordnet werden kann,” Mathematische Annalen, vol. 59, pp. 514–516, 1904, note: Original pa- per introducing the Axiom of Choice. 103 104BIBLIOGRAPHY

    work page 1904

  10. [10]

    Untersuchungen über die grundlagen der mengenlehre i,

    ——, “Untersuchungen über die grundlagen der mengenlehre i,”Math- ematische Annalen, vol. 65, pp. 261–281, 1908

    work page 1908

  11. [11]

    Über den zusammenhang zwischen den grundlagen der mengenlehre und der mathematischen logik,

    A. Fraenkel, “Über den zusammenhang zwischen den grundlagen der mengenlehre und der mathematischen logik,”Mathematische Annalen, vol. 86, pp. 230–237, 1922

    work page 1922

  12. [12]

    On the diagrammatic and mechanical representation of propo- sitions and reasonings,

    J. Venn, “On the diagrammatic and mechanical representation of propo- sitions and reasonings,”Philosophical Magazine and Journal of Science, vol. 10, no. 59, pp. 1–18, 1880

    work page

  13. [13]

    Sur la notion de l’ordre dans la théorie des ensembles,

    K. Kuratowski, “Sur la notion de l’ordre dans la théorie des ensembles,” Fundamenta Mathematicae, vol. 2, pp. 161–171, 1921, note: Introduces the set-theoretic definition of ordered pairs

    work page 1921

  14. [14]

    van Heijenoort, Ed.,From Frege to Gödel: A Source Book in Mathe- matical Logic, 1879–1931

    J. van Heijenoort, Ed.,From Frege to Gödel: A Source Book in Mathe- matical Logic, 1879–1931. Cambridge, MA: Harvard University Press, 1967, note: Contains translations and commentary on foundational works, including the Axiom of Equality

    work page 1931

  15. [15]

    Peano,Arithmetices principia, nova methodo exposita

    G. Peano,Arithmetices principia, nova methodo exposita. Turin: Fratelli Bocca, 1889, note: Original publication of Peano Arithmetic axioms

    work page

  16. [16]

    Dedekind,Was sind und was sollen die Zahlen?Braunschweig: Vieweg, 1888

    R. Dedekind,Was sind und was sollen die Zahlen?Braunschweig: Vieweg, 1888

    work page

  17. [17]

    Mémoiresurlesconditionsderésolubilitédeséquations par radicaux,

    ÉvaristeGalois, “Mémoiresurlesconditionsderésolubilitédeséquations par radicaux,”Journal de Mathématiques Pures et Appliquées, 1846, note: Foundational work introducing group theory concepts

    work page

  18. [18]

    Idealtheorie in ringbereichen,

    E. Noether, “Idealtheorie in ringbereichen,”Mathematische Annalen, vol. 83, pp. 24–66, 1921

    work page 1921

  19. [19]

    Algebraische theorie der körper,

    E. Steinitz, “Algebraische theorie der körper,”Journal für die reine und angewandte Mathematik, vol. 137, pp. 167–309, 1910, note: Founda- tional paper introducing the axiomatic theory of fields

    work page 1910

  20. [20]

    Differential- und Integralrechnung

    R. Courant,Differential and Integral Calculus. Interscience Publishers, 1937, note: Originally published in German in 1924 as “Differential- und Integralrechnung”; introduces geometric metaphors such as slopes and accumulated areas. BIBLIOGRAPHY105

    work page 1937

  21. [21]

    Über die darstellbarkeit einer funktion durch eine trigonometrische reihe,

    B. Riemann, “Über die darstellbarkeit einer funktion durch eine trigonometrische reihe,”Abhandlungen der Königlichen Gesellschaft der Wissenschaften zu Göttingen, 1854

    work page

  22. [22]

    Intégrale, longueur, aire,

    H. Lebesgue, “Intégrale, longueur, aire,” Ph.D. dissertation, Université de Paris, 1902

    work page 1902

  23. [23]

    Newton,Philosophiae Naturalis Principia Mathematica

    I. Newton,Philosophiae Naturalis Principia Mathematica. London: Royal Society, 1687, note: Introduces the foundations of calculus and the Fundamental Theorem of Calculus

    work page

  24. [24]

    Nova methodus pro maximis et minimis, itemque tan- gentibus, quae nec fractas nec irrationales quantitates moratur, et sin- gulare pro illis calculi genus,

    G. W. Leibniz, “Nova methodus pro maximis et minimis, itemque tan- gentibus, quae nec fractas nec irrationales quantitates moratur, et sin- gulare pro illis calculi genus,”Acta Eruditorum, pp. 467–473, 1684, note: Leibniz’s original paper introducing differential calculus, leading to the Fundamental Theorem of Calculus

    work page

  25. [25]

    A. N. Kolmogorov,Grundbegriffe der Wahrscheinlichkeitsrechnung. Berlin: Springer, 1933

    work page 1933

  26. [26]

    New York: Chelsea Publishing Company, 1956

    ——,Foundations of the Theory of Probability, secondenglisheditioned. New York: Chelsea Publishing Company, 1956

    work page 1956

  27. [27]

    J. L. Doob,Stochastic Processes. New York: Wiley, 1953, note: Classic monograph establishing the modern theory of stochastic processes

    work page 1953

  28. [28]

    Extension of the law of large numbers to dependent events,

    A. A. Markov, “Extension of the law of large numbers to dependent events,”Bulletin of the Imperial Academy of Sciences of St. Petersburg, vol. 15, pp. 135–156, 1906, note: Original paper introducing Markov chains

    work page 1906

  29. [29]

    Information theory and statistical mechanics,

    E. T. Jaynes, “Information theory and statistical mechanics,”Physi- cal Review, vol. 106, no. 4, pp. 620–630, 1957, note: Introduces the maximum entropy principle, linking information theory to statistical mechanics

    work page 1957

  30. [30]

    Three approaches to the quantitative definition of information,

    A. N. Kolmogorov, “Three approaches to the quantitative definition of information,”Problemy Peredachi Informatsii, vol. 1, no. 1, pp. 3–11, 1965. 106BIBLIOGRAPHY

    work page 1965

  31. [31]

    The minimum entropy production principle,

    E. T. Jaynes, “The minimum entropy production principle,”Annual Re- view of Physical Chemistry, vol. 31, pp. 579–601, 1980, note: Introduces the principle of Maximum Caliber (MaxCal) as a generalization of the Maximum Entropy principle

    work page 1980

  32. [32]

    Lagrange,Méchanique Analytique

    J.-L. Lagrange,Méchanique Analytique. Paris: Veuve Desaint, 1788, note: Introduces the method of Lagrange multipliers for constrained optimization

    work page

  33. [33]

    Euler,Introductio in Analysin Infinitorum

    L. Euler,Introductio in Analysin Infinitorum. Lausanne: Marcum- Michaelem Bousquet, 1748, note: Introduces modern analysis and infi- nite series

    work page

  34. [34]

    Equilibrium points in n-person games,

    J. F. Nash, “Equilibrium points in n-person games,”Proceedings of the National Academy of Sciences, vol. 36, no. 1, pp. 48–49, 1950

    work page 1950

  35. [35]

    Noiseless coding of correlated information sources,

    D. Slepian and J. K. Wolf, “Noiseless coding of correlated information sources,”IEEE Transactions on Information Theory, vol. 19, no. 4, pp. 471–480, 1973

    work page 1973

  36. [36]

    The rate-distortion function for source coding with side information at the decoder,

    A. D. Wyner and J. Ziv, “The rate-distortion function for source coding with side information at the decoder,”IEEE Transactions on Informa- tion Theory, vol. 22, no. 1, pp. 1–10, 1976

    work page 1976

  37. [37]

    C. F. Gauss,Theoria Motus Corporum Coelestium in Sectionibus Coni- cis Solem Ambientium. Hamburg: Friedrich Perthes and I.H. Besser, 1809, note: Introduces the method of least squares and Gaussian distri- bution

    work page

  38. [38]

    Laplace,Théorie Analytique des Probabilités

    P.-S. Laplace,Théorie Analytique des Probabilités. Paris: Courcier, 1812, note: Foundational treatise on probability theory

    work page

  39. [39]

    Nouvelle forme du théorème sur la limite de la prob- abilité,

    A. M. Lyapunov, “Nouvelle forme du théorème sur la limite de la prob- abilité,”Mémoires de l’Académie Impériale des Sciences de St. Peters- burg, vol. 12, pp. 1–24, 1901, note: Original rigorous proof of the Central Limit Theorem

    work page 1901

  40. [40]

    Boole,An Investigation of the Laws of Thought, on Which are Founded the Mathematical Theories of Logic and Probabilities

    G. Boole,An Investigation of the Laws of Thought, on Which are Founded the Mathematical Theories of Logic and Probabilities. Lon- don: Walton and Maberly, 1854, note: Foundational work introducing Boolean logic, interpreting 0 and 1 as false and true. BIBLIOGRAPHY107

    work page

  41. [41]

    Über unendliche, lineare punktmannigfaltigkeiten,

    G. Cantor, “Über unendliche, lineare punktmannigfaltigkeiten,”Mathe- matische Annalen, vol. 21, pp. 545–591, 1883, note: Foundational paper introducing the Cantor set and advancing set theory

    work page

  42. [42]

    C. F. Gauss,Disquisitiones Arithmeticae. Leipzig: Fleischer, 1801, note: Foundational treatise establishing modern number theory

    work page

  43. [43]

    G. H. Hardy and E. M. Wright,An Introduction to the Theory of Num- bers, 6th ed. Oxford: Oxford University Press, 1938, note: Classic comprehensive textbook on number theory

    work page 1938

  44. [44]

    Euclid,The Thirteen Books of the Elements, T. L. Heath, Ed. Cam- bridge: CambridgeUniversityPress, 1908, englishtranslationofEuclid’s Elements, originally composed circa 300 BCE

    work page 1908

  45. [45]

    Explication de l’arithmétique binaire,

    G. W. Leibniz, “Explication de l’arithmétique binaire,”Mémoires de l’Académie Royale des Sciences, pp. 85–89, 1703, note: Introduces the binary number system and its mathematical applications

    work page

  46. [46]

    Über eine elementare frage der mannigfaltigkeitslehre,

    G. Cantor, “Über eine elementare frage der mannigfaltigkeitslehre,” Jahresbericht der Deutschen Mathematiker-Vereinigung, vol. 1, pp. 75– 78, 1891, note: Introduces the diagonal argument proving the uncount- ability of the real numbers

    work page

  47. [47]

    Über die beziehung zwischen dem zweiten hauptsatze der mechanischen wärmetheorie und der wahrscheinlichkeitsrechnung,

    L. Boltzmann, “Über die beziehung zwischen dem zweiten hauptsatze der mechanischen wärmetheorie und der wahrscheinlichkeitsrechnung,” Sitzungsberichte der Kaiserlichen Akademie der Wissenschaften Wien, vol. 76, pp. 373–435, 1877, note: Original paper introducing the statis- tical definition of entropy,S=k B ln Ω

    work page

  48. [48]

    Zurelektrodynamikbewegterkörper,

    A.Einstein, “Zurelektrodynamikbewegterkörper,”Annalen der Physik, vol. 17, pp. 891–921, 1905, note: Special theory of relativity, founda- tional to quantum physics

    work page 1905

  49. [49]

    The quantum postulate and the recent development of atomic theory,

    N. Bohr, “The quantum postulate and the recent development of atomic theory,” inProceedings of the International Congress of Physics, 1928, note: Introduces complementarity principle in quantum mechanics

    work page 1928

  50. [50]

    G. S. Becker,The Economic Approach to Human Behavior. Chicago: University of Chicago Press, 1976, note: Classic work extending rational choice theory to social sciences. 108BIBLIOGRAPHY

    work page 1976

  51. [51]

    A symbolic analysis of relay and switching circuits,

    C. E. Shannon, “A symbolic analysis of relay and switching circuits,” Transactions of the American Institute of Electrical Engineers, vol. 57, no. 12, pp. 713–723, 1938, note: Foundational work connecting Boolean logic to electrical circuits

    work page 1938

  52. [52]

    Molecular structure of nucleic acids: A structure for deoxyribose nucleic acid,

    J. D. Watson and F. H. C. Crick, “Molecular structure of nucleic acids: A structure for deoxyribose nucleic acid,”Nature, vol. 171, pp. 737–738, 1953, note: Original paper describing DNA as an information-carrying molecule

    work page 1953

  53. [53]

    A logical calculus of the ideas imma- nent in nervous activity,

    W. S. McCulloch and W. Pitts, “A logical calculus of the ideas imma- nent in nervous activity,”Bulletin of Mathematical Biophysics, vol. 5, pp. 115–133, 1943, note: Foundational work modeling neurons as information-processing units

    work page 1943

  54. [54]

    J. M. Smith,Evolution and the Theory of Games. Cambridge: Cam- bridge University Press, 1982, note: Introduces game-theoretic and information-based models of evolution

    work page 1982

  55. [55]

    Ancient Greek Manuscript, 300 BC, note: Founda- tional text in geometry, introducing axiomatic method

    Euclid,Elements. Ancient Greek Manuscript, 300 BC, note: Founda- tional text in geometry, introducing axiomatic method

    work page

  56. [56]

    B. B. Mandelbrot,The Fractal Geometry of Nature. San Francisco: W. H. Freeman and Company, 1982, note: Definitive work introducing fractals and their geometric foundations

    work page 1982

  57. [57]

    NewYork: ColumbiaUniversityPress, 1970, note: Foundational work on constructivist pedagogy, emphasizing knowledge construction from primitives

    J.Piaget,Genetic Epistemology. NewYork: ColumbiaUniversityPress, 1970, note: Foundational work on constructivist pedagogy, emphasizing knowledge construction from primitives

    work page 1970

  58. [58]

    Papert,Mindstorms: Children, Computers, and Powerful Ideas

    S. Papert,Mindstorms: Children, Computers, and Powerful Ideas. New York: Basic Books, 1980

    work page 1980

  59. [59]

    The early history of smalltalk,

    A. Kay, “The early history of smalltalk,” inHistory of Programming Languages, Volume II, T. J. Bergin and R. G. Gibson, Eds. New York: ACM Press, 1993, pp. 511–598

    work page 1993

  60. [60]

    Ifrah,The Universal History of Numbers: From Prehistory to the Invention of the Computer

    G. Ifrah,The Universal History of Numbers: From Prehistory to the Invention of the Computer. New York: John Wiley & Sons, 2000. BIBLIOGRAPHY109

    work page 2000

  61. [61]

    M. A. Nielsen and I. L. Chuang,Quantum Computation and Quantum Information. Cambridge: Cambridge University Press, 2000, note: Definitive textbook on quantum computing, covering qubits, entropy, and information measures in quantum systems

    work page 2000

  62. [62]

    Simulating physics with computers,

    R. P. Feynman, “Simulating physics with computers,”International Journal of Theoretical Physics, vol. 21, no. 6, pp. 467–488, 1982, note: Introduces the concept of quantum computation and qubits as superpo- sitions

    work page 1982

  63. [63]

    A fast learning algorithm for deep belief nets,

    G. Hinton, S. Osindero, and Y.-W. Teh, “A fast learning algorithm for deep belief nets,”Neural Computation, vol. 18, no. 7, pp. 1527–1554, 2006

    work page 2006

  64. [64]

    Deep learning,

    Y. LeCun, Y. Bengio, and G. Hinton, “Deep learning,”Nature, vol. 521, pp. 436–444, 2015

    work page 2015

  65. [65]

    Wiener,Cybernetics: Or Control and Communication in the Animal and the Machine

    N. Wiener,Cybernetics: Or Control and Communication in the Animal and the Machine. MIT Press, 1948

    work page 1948

  66. [66]

    Thermodynamik quantenmechanischer gesamtheiten,

    J. von Neumann, “Thermodynamik quantenmechanischer gesamtheiten,”Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, vol. 1927, pp. 273–291, 1927, note: Introduces von Neumann entropy

    work page 1927