Who Discovered the Binary System and Arithmetic? Did Leibniz Plagiarize Caramuel?

  title={Who Discovered the Binary System and Arithmetic? Did Leibniz Plagiarize Caramuel?},
  author={Juan Ares Casal and Juan Alfonso Lara and David Lizcano and Mar{\'i}a-Aurora Mart{\'i}nez},
  journal={Science and Engineering Ethics},
Gottfried Wilhelm Leibniz (1646–1716) is the self-proclaimed inventor of the binary system and is considered as such by most historians of mathematics and/or mathematicians. Really though, we owe the groundwork of today’s computing not to Leibniz but to the Englishman Thomas Harriot and the Spaniard Juan Caramuel de Lobkowitz (1606–1682), whom Leibniz plagiarized. This plagiarism has been identified on the basis of several facts: Caramuel’s work on the binary system is earlier than Leibniz’s… Expand
3 Citations

Figures and Topics from this paper

The article, in addition to the previous publication of the authors, shows that the binary number system was also described before the great German scientist Gottfried Wilhelm Leibniz, who did so inExpand
What Is Academic Plagiarism
This chapter defends a fourfold heuristic for determining when academic plagiarism has occurred. Drawing from contemporary literature on research integrity, I propose that academic plagiarism hasExpand
Special Issue on the Foundations of Software Science and Computation Structures
In this full review paper, the recent emerging trends in Computing Structures, Software Science, and System Applications have been reviewed and explored to address the recent topics and contributionsExpand


Leibniz, the Master-Builder of Mathematical Notations
NEWTON and DESCARTES did not devote themselves persistently to work on notations. DESCARTES made only minute changes in the algebraic notations of some of his predecessors, but these changes wereExpand
The Universal History of Computing: From the Abacus to the Quantum Computer
From the Publisher: In this brilliant follow-up to his landmark international bestseller, The Universal History of Numbers, Georges Ifrah traces the development of computing from the invention ofExpand
The Universal Computer: The Road from Leibniz to Turing
In this revised edition Davis discusses the success of the IBM Watson on Jeopardy, reorganizes the information on incompleteness, and adds information on Konrad Zuse. Expand
Gottfried Wilhelm Leibniz and the origin of the principle of least action – a never ending story
The priority dispute between Leibniz and Newton on the invention of the calculus was just finished as another quarrel of similar vehemence occupied the scientific community. From the middle of theExpand
A Note on the Entscheidungsproblem
  • A. Church
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1936
It is shown that the general case of the Entscheidungsproblem is unsolvable in any system of symbolic logic which is adequate to a certain portion of arithmetic and is ω-consistent. Expand
Computing: A Concise History
Ceruzzi traces the world-changing evolution of the computer from a room-size ensemble of machinery to a "minicomputer" to a desktop computer to a pocket-sized smart phone and describes the development of the silicon chip, which could store ever-increasing amounts of data and enabled ever-decreasing device size. Expand
Binary Numeration before Leibniz
Though it is frequently stated that binary numeration was first formally proposed by Leibniz as an illustration of his dualistic philosophy, the mathematical papers of Thomas Hariot (1560–1621) showExpand
History of Binary and Other Nondecimal Numeration
The present revised edition is a revised edition of the History of binary and other nondecimal numeration, presented under the title: History of modern numeration systems. Expand
Age of intelligent machines
The Age of Intelligent Machines examines the history of efforts to understand human intelligence and to emulate it by building devices that seem to act with human capabilities. Expand
On Computable Numbers, with an Application to the Entscheidungsproblem
1. Computing machines. 2. Definitions. Automatic machines. Computing machines. Circle and circle-free numbers. Computable sequences and numbers. 3. Examples of computing machines. 4. AbbreviatedExpand