Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2008.03122

Sulla decifratura di Enigma -- Come un reverendo del XVIII secolo contribuì alla sconfitta degli U-boot tedeschi durante la Seconda Guerra Mondiale

Fabio S. Priuli·Claudia Violante
View original source ↗Read source document ↗Export metadata ↓

Abstract

This article, written in Italian language, explores the contribution given by Bayes' rule and by subjective probability in the work at Bletchley Park towards cracking Enigma cyphered messages during WWII. -- In questo articolo, scritto in Italiano, esploriamo il contributo dato dal teorema di Bayes e dalle idee della probabilità soggettiva nel lavoro compiuto a Bletchley Park che ha portato a decifrare i messaggi cifrati con macchine Enigma durante la Seconda Guerra Mondiale.

Explore related subjects

cs.GLcs.CRstat.OT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fabio S. Priuli, Claudia Violante. 2020-07-17. Sulla decifratura di Enigma -- Come un reverendo del XVIII secolo contribuì alla sconfitta degli U-boot tedeschi durante la Seconda Guerra Mondiale. https://arxiv.org/abs/2008.03122

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

The Mathematical Evolution of Addressing: From Yushchenko's Address Programming Language to A Mathematics of Arrays How Addressing Evolved into a Mathematical Theory of Indexing, Array Computation, and Machine Realization

This article argues that a central development in the history of computing is the mathematical evolution of addressing. During the three decades separating Kateryna Yushchenko's Address Programming Language (1958) from Lenore Mullin's A Mathematics of Arrays (1988), addressing evolved from a machine-level mechanism for locating data into a formal theory of indexing, reduction, and machine realization, passing through Kenneth Iverson's algebra of arrays and Philip Abrams' recognition of shape as an architectural resource. Mullin's theory establishes indexing itself, via the function ψ, as the primitive from which array operations compose, reduce to a Denotational Normal Form, transform into an Operational Normal Form, and realize on hardware through dimension lifting. Historical claims are sourced against primary material, with inferences flagged as such; mathematical claims are stated as identities; performance claims are marked validated, theoretically established, or provisional. The result links programming languages, array mathematics, and computer architecture in one account.

cs.GL↗
arXiv2026

The Theorems of Dr. David Blackwell and Their Contributions to Artificial Intelligence

Dr. David Blackwell was a mathematician and statistician of the first rank, whose contributions to statistical theory, game theory, and decision theory predated many of the algorithmic breakthroughs that define modern artificial intelligence. This survey examines three of his most consequential theoretical results the Rao Blackwell theorem, the Blackwell Approachability theorem, and the Blackwell Informativeness theorem (comparison of experiments) and traces their direct influence on contemporary AI and machine learning. We show that these results, developed primarily in the 1940s and 1950s, remain technically live across modern subfields including Markov Chain Monte Carlo inference, autonomous mobile robot navigation (SLAM), generative model training, no-regret online learning, reinforcement learning from human feedback (RLHF), large language model alignment, and information design. NVIDIAs 2024 decision to name their flagship GPU architecture (Blackwell) provides vivid testament to his enduring relevance. We also document an emerging frontier: explicit Rao Blackwellized variance reduction in LLM RLHF pipelines, recently proposed but not yet standard practice. Together, Blackwell theorems form a unified framework addressing information compression, sequential decision making under uncertainty, and the comparison of information sources precisely the problems at the core of modern AI.

cs.GL↗
arXiv2026

The Reconstructions of Konrad Zuse's Z3 Computer

This paper reviews the various reconstructions of Konrad Zuse's Z3 computer, built in 1941. The first is the reconstruction made by Zuse himself in the 1960s, which is now housed at the Deutsches Museum in Munich. Second is the 2001 reconstruction, made in Berlin, and which has a didactic purpose. Third is the Z3r, a Z3 reconstruction built by Horst Zuse in honor of his father's 100th birthday. Fourth is the reconstruction by Christoph Traber in Switzerland. All of these machines strive to preserve the cultural heritage that the Z3 represents.

cs.GL↗