College Publications logo   College Publications title  
View Basket
Homepage Contact page
   
 
AiML
Academia Brasileira de Filosofia
Algorithmics
Cadernos de Lógica e Computação
Cadernos de Lógica e Filosofia
Cahiers de Logique et d'Epistemologie
Communication, Mind and Language
Computing
Cuadernos de lógica, Epistemología y Lenguaje
DEON
Dialogues
Economics
Encyclopaedia of Logic
Filosofia
Handbooks
Historia Logicae
IfColog series in Computational Logic
IfColog Lecture series
IfColog Proceedings
Journal of Applied Logics - IfCoLog Journal
About
Editorial Board
Scope of the Journal
Submissions
Forthcoming papers
Journals
Landscapes
Logics for New-Generation AI
Logic and Law
Logic and Semiotics
Logic PhDs
Logic, Methodology and Philosophy of Science
The Logica Yearbook
Neural Computing and Artificial Intelligence
Philosophy
Research
The SILFS series
Studies in Logic
Studies in Talmudic Logic
Systems
Texts in Logic and Reasoning
Texts in Mathematics
Tributes
Other
Digital Downloads
Information for authors
About us
Search for Books
 



Forthcoming papers


Back

Infinity in computable probability

Maarten McKubre-Jordens and Phillip L. Wilson

Does combining a finite collection of objects infinitely many times guarantee
the construction of a particular object? Here we use recursive function theory
to examine the popular scenario of an infinite collection of typing monkeys
reproducing the works of Shakespeare. Our main result is to show that it is
possible to assign typing probabilities in such a way that while it is impossible
that no monkey reproduces Shakespeare’s works, the probability of any finite
collection of monkeys doing so is arbitrarily small. We extend our results to
target-free writing, and end with a broad discussion and pointers to future work.

July 2019






© 2005–2022 College Publications / VFH webmaster