In computability theory, a set of natural numbers is called recursive, computable or decidable if there is an algorithm which terminates after aâ€¦Â (More)

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

2016

2016

- Arnold Beckmann, Samuel R. Buss, Sy-David Friedman, Moritz MÃ¼ller, Neil Thapen
- Ann. Pure Appl. Logic
- 2016

This paper introduces the Cobham Recursive Set Functions (CRSF) as a version of polynomial time computable functions on generalâ€¦Â (More)

Is this relevant?

2015

2015

- Arnold Beckmann, Samuel R. Buss, Sy-David Friedman
- J. Symb. Log.
- 2015

We introduce the safe recursive set functions based on a Bellantoni-Cook style subclass of the primitive recursive set functionsâ€¦Â (More)

Is this relevant?

2014

2014

- Marco Casini
- 2014

Recursive approximation of the set of feasible parameters is a key problem in set membership identification. In this paper a newâ€¦Â (More)

Is this relevant?

2010

2010

This paper presents some new theorems concerning recursively enumerable (r.e.) sets. The aim of the paper is to advance theâ€¦Â (More)

Is this relevant?

Highly Cited

2009

Highly Cited

2009

- Rakesh Bobba, Himanshu Khurana, Manoj Prabhakaran
- ESORICS
- 2009

In distributed systems users need to share sensitive objects with others based on the recipientsâ€™ ability to satisfy a policyâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Jeremiah J. Faith, Michael E. Driscoll, +5 authors Timothy S. Gardner
- Nucleic Acids Research
- 2008

Many Microbe Microarrays Database (M3D) is designed to facilitate the analysis and visualization of expression data in compendiaâ€¦Â (More)

Is this relevant?

2002

2002

- Vasco Brattka
- ICALP
- 2002

Generalizing the notion of a recursively enumerable (r.e.) set to sets of real numbers and other metric spaces is an importantâ€¦Â (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- Robert E. Gompf
- 1998

The topology of Stein surfaces and contact 3-manifolds is studied by means of handle decompositions. A simple characterization ofâ€¦Â (More)

Is this relevant?

1997

1997

- Victor W. Marek, Anil Nerode, Jeffrey B. Remmel
- Arch. Math. Log.
- 1997

Abstract We study nonmonotonic rule systems with rules that admit infinitely many restraints. We concentrate on the case when theâ€¦Â (More)

Is this relevant?

1997

1997

We propose a new low-complexity entropy-coding method to be used for coding waveform signals. It is based on the combination ofâ€¦Â (More)

Is this relevant?