Related papers: Zeno machines and Running Turing machine for infin…
There have been many attempts to solve the P versus NP problem. However, with a new proof method, P not equal NP can be proved. A time limit is set for an arbitrary Turing machine and an input word is rejected on a timeout. The time limit…
The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptotic probability one, so that as the number of states n…
In this essay, I argue that explicit ethical machines, whose moral principles are inferred through a bottom-up approach, are unable to replicate human-like moral reasoning and cannot be considered moral agents. By utilizing Alan Turing's…
This essay explores the limits of Turing machines concerning the modeling of minds and suggests alternatives to go beyond those limits.
This paper constructively proves the existence of an effective procedure generating a computable (total) function that is not contained in any given effectively enumerable set of such functions. The proof implies the existence of machines…
Developing protocols for preserving information in quantum systems is a central quest for implementing realistic quantum computation. In this regard, the quantum Zeno effect has emerged as a widely utilized technique to safeguard classical…
The Carnot heat engine sets an upper bound on the efficiency of a heat engine. As an ideal, reversible engine, a single cycle must be performed in infinite time, and so the Carnot engine has zero power. However, there is nothing in…
The halting problem is considered to be an essential part of the theoretical background to computing. That halting is not in general computable has supposedly been proved in many text books and taught on many computer science courses, in…
The quantum Zeno effect arises due to frequent observation. That implies the existence of some experimenter and its interaction with the system. In this contribution, we examine what happens for a closed system if one considers a quantum…
The Turing machine, as it was presented by Turing himself, models the calculations done by a person. This means that we can compute whatever any Turing machine can compute, and therefore we are Turing complete. The question addressed here…
This paper provides a new and more direct proof of the assertion that a Turing computable function of the natural numbers is primitive recursive if and only if the time complexity of the corresponding Turing machine is bounded by a…
This paper aims to question the suitability of the Turing Test, for testing machine intelligence, in the light of advances made in the last 60 years in science, medicine, and philosophy of mind. While the main concept of the test may seem…
In this paper the claim that Zeno's paradoxes have been solved is contested. Although no one has ever touched Zeno without refuting him (Whitehead), it will be our aim to show that, whatever it was that was refuted, it was certainly not…
The Turing Test is no longer adequate for distinguishing human and machine intelligence. With advanced artificial intelligence systems already passing the original Turing Test and contributing to serious ethical and environmental concerns,…
The paper proposes a framework for the construction of solutions to a hybrid dynamical system that exhibit Zeno behavior. A new approach that enables solution to be prolonged after reaching its Zeno time is developed. It allows for a…
I describe the early (1974--75) work I did on what is now called the Zeno problem in quantum mechanics. Then I propose a new formulation which may obviate a vexing problem of operator limits and which also may be more…
$\textit{Magic: The Gathering}$ is a popular and famously complicated trading card game about magical combat. In this paper we show that optimal play in real-world $\textit{Magic}$ is at least as hard as the Halting Problem, solving a…
Infinite time Turing machines with only one tape are in many respects fully as powerful as their multi-tape cousins. In particular, the two models of machine give rise to the same class of decidable sets, the same degree structure and, at…
Continuing the study of complexity theory of Koepke's Ordinal Turing Machines (OTMs) that was started by Rin, L\"owe and the author, we prove the following results: (1) An analogue of Ladner's theorem for OTMs holds: That is, there are…
We introduce a model of infinitary computation which enhances the infinite time Turing machine model slightly but in a natural way by giving the machines the capability of detecting cardinal stages of computation. The computational strength…