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.

Highly Cited

2009

Highly Cited

2009

In this paper we study a new approach to classify mathemat- ical theorems according to their computational content. Basically, we… Expand

Is this relevant?

Highly Cited

2007

Highly Cited

2007

In the last decade, there have been several attempts to understand the relations between the many models of analog computation… Expand

Is this relevant?

Highly Cited

2005

Highly Cited

2005

One day, you will discover a new adventure and knowledge by spending more money. But when? Do you think that you need to obtain… Expand

Is this relevant?

2005

2005

The computation of reachable sets of nonlinear dynamic and control systems is an important problem of systems theory. In this… Expand

Is this relevant?

Highly Cited

2003

Highly Cited

2003

The notions "recursively enumerable" and "recursive" are the basic notions of effectivity in classical recursion theory. In… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid fundament for… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

Computable Analysis studies those functions on the real numbers and related sets which can be computed by machines such as… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

In this dissertation, I explore aspects of computable analysis and topology in the framework of relative realizability. The… Expand

Is this relevant?

1997

1997

While for countable sets there is a single well established computability theory (ordinary recursion theory), Computable Analysis… Expand

Is this relevant?

1989