Related papers: In Memory of Martin Davis

Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…

This paper introduces a new computing model based on the cooperation among Turing machines called orchestrated machines. Like universal Turing machines, orchestrated machines are also designed to simulate Turing machines but they can also…

Dementia is a collection of symptoms associated with impaired cognition and impedes everyday normal functioning. Dementia, with Alzheimer's disease constituting its most common type, is highly complex in terms of etiology and…

Most of our lives are conducted in the cyberspace. The human notion of privacy translates into a cyber notion of privacy on many functions that take place in the cyberspace. This article focuses on three such functions: how to privately…

This is a tutorial for the many-worlds theory by Everett, which includes some of my personal views. It has two main parts.The first main part shows the emergence of many worlds in a universe consisting of only a Mach-Zehnder interferometer.…

Can a Turing Machine simulate the human mind? If the Church-Turing thesis is assumed to be true, then a Turing Machine should be able to simulate the human mind. In this paper, I challenge that assumption by providing strong mathematical…

The quest to understand consciousness, once the purview of philosophers and theologians, is now actively pursued by scientists of many stripes. This paper studies consciousness from the perspective of theoretical computer science. It…

We give an overview of several of the mathematical works of Gilles Lachaud and provide a historical context. This is interspersed with some personal anecdotes highlighting many facets of his personality.

Automated decision systems (ADS) are increasingly used for consequential decision-making. These systems often rely on sophisticated yet opaque machine learning models, which do not allow for understanding how a given decision was arrived…

Universal Turing Machines [29, 10, 18] are well known in computer science but they are about manual programming for general purposes. Although human children perform conscious learning (i.e., learning while being conscious) from infancy…

The Turing Machine is the paradigmatic case of computing machines, but there are others such as analogical, connectionist, quantum and diverse forms of unconventional computing, each based on a particular intuition of the phenomenon of…

Computational models pervade all branches of the exact sciences and have in recent times also started to prove to be of immense utility in some of the traditionally 'soft' sciences like ecology, sociology and politics. This volume is a…

There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…

This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…

This paper is concerned with a dialogue between Rabindranath Tagore and Albert Einstein, where Tagore argued that our knowledge is essentially human, while Einstein maintained that some kinds of knowledge are more objective. Arguments by…

The rise of machine learning (ML) is accompanied by several high-profile cases that have stressed the need for fairness, accountability, explainability and trust in ML systems. The existing literature has largely focused on fully automated…

We show that multiplication can be done in polynomial time on a three counter machine that receives its input as the contents of two counters. The technique is generalized to functions of two variables computable by deterministic Turing…

We consider the problem of multi-task learning in the high dimensional setting. In particular, we introduce an estimator and investigate its statistical and computational properties for the problem of multiple connected linear regressions…

This survey article on Hilbert's first and second problems is adapted from a one-hour colloquium lecture given at the University of Auckland in May, 2000, just three months before the 100th anniversary of Hilbert's lecture. It includes an…

Without attempting to summarize the vast field of statistical mechanics, we briefly mention some of the progress that was made in areas which have enjoyed Barry Simon's interests. In particular, we focus on rigorous non-perturbative results…