First, in contrast to much of the existing literature, the Lovelace-Babbage question is not a zero-sum game, where some portion of credit added to Lovelace somehow detracts from Babbage, or vice versa. There is ample evidence that Babbage a…In The Babbage Machine and the Origins of Programming, the authors reproduce Lovelace’s table for the Bernoulli numbers and translate the algorithm into a 65-FORTRAN program that compute them. The program has eight “if . . . [then] go-to” s…
Jacob Bernoulli
mathematician · 2 mentions across 1 reading
In this course
Jacob Bernoulli appears in the course primarily as a mathematical reference point rather than a major figure in AI or cybernetics—his eponymous numbers serve as the test case for evaluating Ada Lovelace's early algorithmic thinking. The readings use Bernoulli numbers as a concrete historical anchor to examine the Lovelace-Babbage collaboration, translating Lovelace's original algorithm into modern programming languages to assess her contributions to computational theory. His presence underscores how early mathematics became a proving ground for demonstrating that Lovelace's work constituted genuine programming, not mere transcription.
Mentioned in 1 reading
Appears alongside
People mentioned in the same passages — sorted by co-occurrence weight.