Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

We develop a model of computation as an unbounded process, measuring complexity by the number of observed behavioural changes… Expand

Is this relevant?

2007

2007

Wegner and Eberbach have argued that there are fundamental limitations to Turing Machines as a foundation of computability and… Expand

Is this relevant?

2005

2005

We describe a novel machine model of computation, and prove that this model is capable of performing calculations beyond the… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

We describe a possible physical device that computes a function that cannot be computed by a Turing machine. The device is… Expand

Is this relevant?

Highly Cited

2004

Highly Cited

2004

In the last years, recursive functions over the reals (Theoret. Comput. Sci. 162 (1996) 23) have been considered, first as a… Expand

Is this relevant?

2004

2004

Despite the recursive non-computability of Hilbert's tenth problem, we outline and argue for a quantum algorithm that is based on… Expand

Is this relevant?

2004

2004

Abstract Some philosophers have conflated functionalism and computationalism. I reconstruct how this came about and uncover two… Expand

Is this relevant?

2003

2003

From the Publisher:
This is the first book-length presentation and defense of a new theory of human and machine cognition… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

We characterise explicitly the decidable predicates on integers of Infinite Time Turing machines. in terms of admissibility… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

Abstract We explore the simulation and computational capabilities of discrete and continuous dynamical systems. We introduce and… Expand

Is this relevant?