中文
相关论文

相关论文: Finiteness of the universe and computation beyond …

200 篇论文

This paper describes a type of infinitary computer (a hypercomputer) capable of computing truth in initial levels of the set theoretic universe, V. The proper class of such hypercomputers is called a universal hypercomputer. There are two…

逻辑 · 数学 2019-05-13 Andrew Powell

Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…

计算机科学中的逻辑 · 计算机科学 2020-08-13 Stefano Guerrini , Simone Martini , Andrea Masini

Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, one argues that it is not unconceivable that classical physical systems may "compute the hard or even the…

混沌动力学 · 物理学 2010-09-30 Cristian S. Calude , Elena Calude , Karl Svozil

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…

人工智能 · 计算机科学 2016-09-05 Ramón Casares

Ultrafinitism postulates that we can only compute on relatively short objects, and numbers beyond certain value are not available. This approach would also forbid many forms of infinitary reasoning and allow to remove certain paradoxes…

编程语言 · 计算机科学 2024-08-22 Michał J. Gajda

We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic processes is considered…

量子物理 · 物理学 2009-11-07 Tien D. Kieu

With the great success in simulating many intelligent behaviors using computing devices, there has been an ongoing debate whether all conscious activities are computational processes. In this paper, the answer to this question is shown to…

量子物理 · 物理学 2011-11-09 Daegene Song

Two aspects of the physical side of the Church-Turing thesis are discussed. The first issue is a variant of the Eleatic argument against motion, dealing with Zeno squeezed time cycles of computers. The second argument reviews the issue of…

量子物理 · 物理学 2007-05-23 Karl Svozil

Suspicions that the world might be some sort of a machine or algorithm existing ``in the mind'' of some symbolic number cruncher have lingered from antiquity. Although popular at times, the most radical forms of this idea never reached…

综合物理 · 物理学 2007-05-23 Karl Svozil

The purpose of this paper is to elucidate, by means of concepts and theorems drawn from mathematical logic, the conditions under which the existence of a multiverse is a logical necessity in mathematical physics, and the implications of…

综合物理 · 物理学 2014-11-20 Gordon McCabe

Many different definitions of computational universality for various types of dynamical systems have flourished since Turing's work. We propose a general definition of universality that applies to arbitrary discrete time symbolic dynamical…

计算复杂性 · 计算机科学 2007-05-23 Jean-Charles Delvenne , Petr Kurka , Vincent Blondel

There exists a growing literature on the so-called physical Church-Turing thesis in a relativistic spacetime setting. The physical Church-Turing thesis is the conjecture that no computing device that is physically realizable (even in…

物理学史与哲学 · 物理学 2017-05-22 Christian Wuthrich

Quantum theory (QT) has been confirmed by numerous experiments, yet we still cannot fully grasp the meaning of the theory. As a consequence, the quantum world appears to us paradoxical. Here we shed new light on QT by being based on two…

量子物理 · 物理学 2019-05-21 Alessio Benavoli , Alessandro Facchini , Marco Zaffalon

The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools…

量子物理 · 物理学 2007-05-23 Lance Fortnow

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…

We prove that if our calculating capability is that of a universal Turing machine with a finite tape, then Church's thesis is true. This way we accomplish Post (1936) program.

计算机科学中的逻辑 · 计算机科学 2023-03-22 Ramón Casares

Computers are physical systems: what they can and cannot do is dictated by the laws of physics. In particular, the speed with which a physical device can process information is limited by its energy and the amount of information that it can…

量子物理 · 物理学 2015-06-26 Seth Lloyd

Several examples are used to illustrate how we deal cavalierly with infinities and unphysical systems in physics. Upon examining these examples in the context of infinities from Cantor's theory of transfinite numbers, the only known…

数学物理 · 物理学 2007-05-23 P. Narayana Swamy

A fundamental problem of Einstein's theory of classical general relativity is the existence of singularities such as the big bang. All known laws of physics end at these boundaries of classical space-time. Thanks to recent developments in…

计算物理 · 物理学 2018-09-07 Parampreet Singh

It is proposed that the physical universe is an instance of a mathematical structure which possesses a dual structure, and that this dual structure is the collection of all possible knowledge of the physical universe. In turn, the physical…

综合物理 · 物理学 2008-05-26 Gordon McCabe