General-purpose computation with neural networks: A survey of complexity theoretic results

J Šíma, P Orponen - Neural Computation, 2003 - ieeexplore.ieee.org
We survey and summarize the literature on the computational aspects of neural network
models by presenting a detailed taxonomy of the various models according to their …

The Turing machine paradigm in contemporary computing

J Van Leeuwen, J Wiedermann - Mathematics unlimited—2001 and …, 2001 - Springer
The importance of algorithms is now recognized in all mathematical sciences, thanks to the
development of computability and computational complexity theory in the 20th century. The …

Computational complexity with experiments as oracles

E Beggs, JF Costa, B Loff… - Proceedings of the …, 2008 - royalsocietypublishing.org
We discuss combining physical experiments with machine computations and introduce a
form of analogue–digital (AD) Turing machine. We examine in detail a case study where an …

Polynomial time quantum computation with advice

H Nishimura, T Yamakami - Information Processing Letters, 2004 - Elsevier
Advice is supplementary information that enhances the computational power of an
underlying computation. This paper focuses on advice that is given in the form of a pure …

Limits to measurement in experiments governed by algorithms

EJ Beggs, JF Costa, JV Tucker - Mathematical Structures in …, 2010 - cambridge.org
We pose the following question: If a physical experiment were to be completely controlled by
an algorithm, what effect would the algorithm have on the physical measurements made …

Three forms of physical measurement and their computability

E Beggs, JF Costa, JV Tucker - The Review of Symbolic Logic, 2014 - cambridge.org
We have begun a theory of measurement in which an experimenter and his or her
experimental procedure are modeled by algorithms that interact with physical equipment …

Computational complexity with experiments as oracles. II. Upper bounds

E Beggs, JF Costa, B Loff… - Proceedings of the …, 2009 - royalsocietypublishing.org
Earlier, to explore the idea of combining physical experiments with algorithms, we
introduced a new form of analogue–digital (AD) Turing machine. We examined in detail a …

Axiomatizing physical experiments as oracles to algorithms

EJ Beggs, JF Costa, JV Tucker - … Transactions of the …, 2012 - royalsocietypublishing.org
We developed earlier a theory of combining algorithms with physical systems, on the basis
of using physical experiments as oracles to algorithms. Although our concepts and methods …

An analogue-digital model of computation: Turing machines with physical oracles

T Ambaram, E Beggs, J Félix Costa, D Poças… - … Computing: Volume 1 …, 2017 - Springer
We introduce an abstract analogue-digital model of computation that couples Turing
machines to oracles that are physical processes. Since any oracle has the potential to boost …

Computability and complexity of unconventional computing devices

H Broersma, S Stepney, G Wendin - Computational Matter, 2018 - Springer
We discuss some claims that certain UCOMP devices can perform hypercomputation
(compute Turing-uncomputable functions) or perform super-Turing computation (solve NP …