Four working replicas preserve Zuse's lost Z3
The 1941 relay computer was destroyed in 1943; these machines let the public see it operate.
cs.GL
General Literature
Covers introductory material, survey material, predictions of future trends, biographies, and miscellaneous computer-science related material. Roughly includes all of ACM Subject Class A, except it does not include conference proceedings (which will be listed in the appropriate subject area).
sort pith recommended most recent
Digital objects are material bitstring symbols
Not hybrid or free-floating code: form and function stay tied to physical substrate
· “A realist theory of digital objects, digital systems, and digitalized systems”
Local LLM scores train an FCM that tracks hotel stars
Predicted satisfaction from Greek reviews correlates with real ratings the model never saw
Tensor diagrams shorten proofs of identities and gradients
Graphical notation replaces index algebra with visual contractions for high-dimensional tensors in machine learning.
PIS framework unites people, IT and structures for MIS research
It models them as mutually constitutive in structuration to bridge fragmented theories and inform AI studies.
Fréchet distance history explains modern AI evaluation metric
Tracing from 1906 abstract sets through curve geometry and probability couplings shows FID as Wasserstein-2 distance between Gaussians in a
· “A Brief History of Fr\'echet Distances: From Curves and Probability Laws to FID”
Physical differences become meaningful states in protocell clusters
Casimir-Lifshitz forces allow clusters to regulate tasks like approach and stabilization through reproducible attractors and gradients.
TinyML enables real-time intrusion detection on CubeSats
Lightweight models fit on constrained hardware to protect satellites from cyber threats introduced by commercial parts and open software.
Abrial created Z, B-Method, and Event-B for industrial systems
The biography follows his ideas from early languages to tools that support specification, refinement, and proof at scale.
· “Jean-Raymond Abrial: A Scientific Biography of a Formal Methods Pioneer”
First CS research paper written entirely in Telugu
Sanskrit grammar supplies the terms and TeluguTeX handles the math to prove lower bounds for multiprocessor algorithms
Soft best-of-N sampling matches RLHF in the large-N limit
Same tilted target distribution underlies RLHF, RLIF, and soft best-of-N sampling.
The history of digital ethics runs in three epochs
From pre-digital reflection to ethics for fully digital lives, one map ties the field together.
One in five repositories holds self-admitted aging debt
A taxonomy of comment-admitted aging separates active upkeep from dormant deprecation.
· “Detection, Classification and Prevalence of Self-Admitted Aging Debt”
Ten years turned symbolic math programs into integrated systems
A half-century survey shows 1965–1975 established the algorithms and institutions behind modern computer algebra.
· “Symbolic Mathematical Computation 1965--1975: The emergence of a discipline”
Nine steps structure open-pit mining from exploration to shipment
Survey identifies where AI and automation can tackle engineering problems in Pilbara iron ore operations.
Oprema: the 14-month relay computer that launched East German computing
Reconstruction of the Jena machine sets the start of East German computing in 1954, not later.
Seven principles turn petabyte archives into interactive labs
A flexible, open, data-proximate stack lets scientists query huge datasets in real time instead of waiting on downloads.
· “Seven Principles for Effective Scientific Big-DataSystems”
Parallel supercomputing hits a nature-imposed efficiency wall
A proposed redesign makes core-to-core communication scale logarithmically instead of linearly, opening a route to exascale.
· “The need for modern computing paradigm: Science applied to computing”
Kolmogorov seminar revived Soviet work on algorithmic complexity
Personal record shows activity dropped after Levin left then rose again once the seminar drew in new researchers
· “Kolmogorov complexity in the USSR (1975--1982): isolation and its end”
Chair's decade of IT migration shows centralization limits
Local-to-university handovers at TUM reveal ongoing issues likely shared by other decentralized academic units.
· “Challenges in IT Operations Management at a German University Chair -- Ten Years in Retrospect”
Tree shadows compute only when we use them to think
Computation is not intrinsic to nature; it is a fixed process used to externalize thought in a contingent environment.
Citation counts across fields follow a constant-ratio law
Normalized by field, top mathematicians, chemists, and materials scientists can compete with clinical medicine on one list.
Modulo hashing can spread users across servers evenly
The paper surveys simple and refined hash rules, arguing they generalize to any finite-resource pool.