English
Related papers

Related papers: A Universal Hypercomputer

200 papers

Models of computation operating over the real numbers and computing a larger class of functions compared to the class of general recursive functions invariably introduce a non-finite element of infinite information encoded in an arbitrary…

Computational Complexity · Computer Science 2010-12-20 Hector Zenil

Hyperdimensional (HD) computing is a set of neurally inspired methods for obtaining high-dimensional, low-precision, distributed representations of data. These representations can be combined with simple, neurally plausible algorithms to…

Machine Learning · Computer Science 2022-02-21 Anthony Thomas , Sanjoy Dasgupta , Tajana Rosing

Recent works have independently suggested that Quantum Mechanics might permit for procedures that transcend the power of Turing Machines as well as of `standard' Quantum Computers. These approaches rely on and indicate that Quantum…

Quantum Physics · Physics 2010-05-10 Martin Ziegler

Traditional computers work with finite numbers. Situations where the usage of infinite or infinitesimal quantities is required are studied mainly theoretically. In this paper, a recently introduced computational methodology (that is not…

Numerical Analysis · Mathematics 2012-03-15 Yaroslav D. Sergeyev

Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit…

Quantum Physics · Physics 2018-09-06 Nian-Quan Jiang , Yao Chen , Chuanbing Cai , Ming-FengWang , Junwang Tang

Due to common misconceptions about the Church-Turing thesis, it has been widely assumed that the Turing machine provides an upper bound on what is computable. This is not so. The new field of hypercomputation studies models of computation…

Logic · Mathematics 2007-05-23 Toby Ord

Within the framework of computable infinitary continuous logic, we develop a system of hyperarithmetic numerals. These numerals are infinitary sentences in a metric language $L$ that have the same truth value in every interpretation of $L$.…

Logic · Mathematics 2022-11-03 Caleb M. H. Camrud , Timothy H. McNicholl

Universal memcomputing machines (UMMs) [IEEE Trans. Neural Netw. Learn. Syst. 26, 2702 (2015)] represent a novel computational model in which memory (time non-locality) accomplishes both tasks of storing and processing of information. UMMs…

Neural and Evolutionary Computing · Computer Science 2019-05-29 Yan Ru Pei , Fabio L. Traversa , Massimiliano Di Ventra

There exist many applications where it is necessary to approximate numerically derivatives of a function which is given by a computer procedure. In particular, all the fields of optimization have a special interest in such a kind of…

Numerical Analysis · Mathematics 2012-03-15 Yaroslav D. Sergeyev

The nature of quantum computation is discussed. It is argued that, in terms of the amount of information manipulated in a given time, quantum and classical computation are equally efficient. Quantum superposition does not permit quantum…

Quantum Physics · Physics 2014-06-10 A. M. Steane

Quantum computing is a new model of computation, based on quantum physics. Quantum computers can be exponentially faster than conventional computers for problems such as factoring. Besides full-scale quantum computers, more restricted…

Formal Languages and Automata Theory · Computer Science 2018-07-05 Andris Ambainis , Abuzer Yakaryılmaz

By the sometimes so-called 'Main Theorem' of Recursive Analysis, every computable real function is necessarily continuous. We wonder whether and which kinds of HYPERcomputation allow for the effective evaluation of also discontinuous…

Logic in Computer Science · Computer Science 2010-05-10 Martin Ziegler

We introduce the notion of universal memcomputing machines (UMMs): a class of brain-inspired general-purpose computing machines based on systems with memory, whereby processing and storing of information occur on the same physical location.…

Neural and Evolutionary Computing · Computer Science 2015-12-17 Fabio L. Traversa , Massimiliano Di Ventra

The purpose of this thesis is to make an analysis of the concept of Hypercomputation and of some hypermachines. This thesis is separated in three main parts. We start in the first chapter with an analysis of the concept of Classical…

Computational Complexity · Computer Science 2012-10-29 Gentian Kasa

We extend in a natural way the operation of Turing machines to infinite ordinal time, and investigate the resulting supertask theory of computability and decidability on the reals. The resulting computability theory leads to a notion of…

Logic · Mathematics 2007-05-23 Joel David Hamkins , Andy Lewis

We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…

Logic · Mathematics 2017-07-19 Dmytro Taranovsky

Quantum computers take advantage of interfering quantum alternatives in order to handle problems that might be too time consuming with algorithms based on classical logic. Developing quantum computers requires new ways of thinking beyond…

Quantum Physics · Physics 2014-09-10 W. C. Parke

Hyperdimensional (HD) computing is built upon its unique data type referred to as hypervectors. The dimension of these hypervectors is typically in the range of tens of thousands. Proposed to solve cognitive tasks, HD computing aims at…

Machine Learning · Computer Science 2020-06-08 Lulu Ge , Keshab K. Parhi

The Hilbert space formalism of quantum mechanics is reviewed with emphasis on applications to quantum computing. Standard interferomeric techniques are used to construct a physical device capable of universal quantum computation. Some…

High Energy Physics - Theory · Physics 2007-05-23 K. Svozil

Hypercomputation is a relatively new branch of computer science that emerged from the idea that the Church--Turing Thesis, which is supposed to describe what is computable and what is noncomputable, cannot possible be true. Because of its…

Other Computer Science · Computer Science 2009-10-12 Apostolos Syropoulos
‹ Prev 1 2 3 10 Next ›