Related papers: Maxwell's daemon, the Turing machine, and Jaynes' …
This chapter presents probability logic as a rationality framework for human reasoning under uncertainty. Selected formal-normative aspects of probability logic are discussed in the light of experimental evidence. Specifically, probability…
This is the transcript of a lecture given at UMass-Lowell in which I compare and contrast the work of Godel and of Turing and my own work on incompleteness. I also discuss randomness in physics vs randomness in pure mathematics.
Eudaemonics is the study of the nature, causes, and conditions of human well-being. According to the ethical theory of eudaemonia, reaping satisfaction and fulfillment from life is not only a desirable end, but a moral responsibility.…
This note is an extended read of my read of Laplace's book Theorie Analytique des Probabilites, when considered from a Bayesian viewpoint but without historical nor comparative pretentions. A deeper analysis is provided in Dale (1999).
This paper looks at Turing's postulations about Artificial Intelligence in his paper 'Computing Machinery and Intelligence', published in 1950. It notes how accurate they were and how relevant they still are today. This paper notes the…
Logic has its origins in basic questions about the nature of the real world and how we describe it. This article seeks to bring out the physical and epistemological relevance of some of the more recent technical work in logic and…
Some thoughts are presented on the inter-relation between beauty and truth in science in general and theoretical physics in particular. Some conjectural procedures that can be used to create new ideas, concepts and results are illustrated…
The 75th anniversary of Turing's seminal paper and his centennial year anniversary occur in 2011 and 2012, respectively. It is natural to review and assess Turing's contributions in diverse fields in the light of new developments that his…
We offer a few comments derived from a careful reading of Michael Strevens' book {\it The Knowledge Machine} (TKM), with an emphasis on extensions for future work. We believe this book goes well beyond traditional accounts of scientific…
The paper addresses some fundamental and hotly debated issues for high-stakes event predictions underpinning the computational approach to social sciences. We question several prevalent views against machine learning and outline a new…
Two Turing Machines may be able to answer questions about each other that they cannot answer about themselves.
This book is the final version of a course on algorithmic information theory and the epistemology of mathematics and physics. This is camera-ready copy prepared for publication as a book, but at the last minute I decided to publish it…
Following a paper in which the fundamental aspects of probabilistic inference were introduced by means of a toy experiment, details of the analysis of simulated long sequences of extractions are shown here. In fact, the striking performance…
In his seminal paper ``Computing Machinery and Intelligence'', Alan Turing introduced the ``imitation game'' as part of exploring the concept of machine intelligence. The Turing Test has since been the subject of much analysis, debate,…
The last century saw dramatic challenges to the Laplacian predictability which had underpinned scientific research for around 300 years. Basic to this was Alan Turing's 1936 discovery (along with Alonzo Church) of the existence of…
A fundamental problem in science is how to make logical inferences from scientific data. Mere data does not suffice since additional information is necessary to select a domain of models or hypotheses and thus determine the likelihood of…
Many papers have been published over the years that either conjecture or even (claim to) prove the universality of the form of Maxwell's equations. We present yet another derivation of Maxwell's equations and discuss the conclusions…
Incompleteness theorems of Godel, Turing, Chaitin, and Algorithmic Information Theory have profound epistemological implications. Incompleteness limits our ability to ever understand every observable phenomenon in the universe.…
This paper is an experimental exploration of the relationship between the runtimes of Turing machines and the length of proofs in formal axiomatic systems. We compare the number of halting Turing machines of a given size to the number of…
This paper is a top down historical perspective on the several phases in the development of probability from its prehistoric origins to its modern day evolution, as one of the key methodologies in artificial intelligence, data science, and…