Search Results - publications of computability and recursion theory

Complexity of Self‐Assembled Shapes by Soloveichik, David, Winfree, Erik

“…The connection between self-assembly and computation suggests that a shape can be considered the output of a self-assembly "program," a set of tiles that fit…”
Get full text

On the Complexity of Numerical Analysis by Allender, Eric, Bürgisser, Peter, Kjeldgaard-Pedersen, Johan, Miltersen, Peter Bro

“…We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis: (a) the Blum-Shub-Smale model of…”
Get full text

Randomness, Computability, and Density by Downey, Rod G., Hirschfeldt, Denis R., Nies, André

“…We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay…”
Get full text

Solving Non-Uniqueness in Agglomerative Hierarchical Clustering Using Multidendrograms by FERNANDEZ, Alberto, GOMEZ, Sergio

“…In agglomerative hierarchical clustering, pair-group methods suffer from a problem of non-uniqueness when two or more distances between different clusters…”
Get full text

A Kleene characterization of computability by Engelfriet, Joost

“…The recursively enumerable binary relations are the smallest class containing all singleton relations and closed under union, concatenation, Kleene star,…”
Get full text

Moschovakis Extension of Represented Spaces by Skordev, Dimiter

“…Given a represented space (in the sense of TTE theory), an appropriate representation is constructed for the Moschovakis extension of its carrier…”
Get full text

Power from Random Strings by Allender, Eric, Buhrman, Harry, Koucký, Michal, van Melkebeek, Dieter, Ronneburger, Detlef

“…We show that sets consisting of strings of high Kolmogorov complexity provide examples of sets that are complete for several complexity classes under…”
Get full text

Computability of simple games: A characterization and application to the core by Kumabe, Masahiro, Mihara, H. Reiju

“…The class of algorithmically computable simple games (i) includes the class of games that have finite carriers and (ii) is included in the class of games that…”
Get full text

Computability versus exact computability of martingales by Lutz, Jack H.

“…This note gives a simple example of a polynomial-time computable martingale that has rational values but is not exactly computable…”
Get full text

Simultaneous Search by Chade, Hector, Smith, Lones

“…We introduce and solve a new class of "downward-recursive" static portfolio choice problems. An individual simultaneously chooses among ranked stochastic…”
Get full text

Fitting Tree Metrics: Hierarchical Clustering and Phylogeny by Ailon, Nir, Charikar, Moses

“…Given dissimilarity data on pairs of objects in a set, we study the problem of fitting a tree metric to this data so as to minimize additive error (i.e., some…”
Get full text

Levels of undecidability in rewriting by Endrullis, Jörg, Geuvers, Herman, Simonsen, Jakob Grue, Zantema, Hans

“…Undecidability of various properties of first-order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the…”
Get full text

Dimension in Complexity Classes by Lutz, Jack H.

“…A theory of resource-bounded dimension is developed using gales, which are natural generalizations of martingales…”
Get full text

The Haar Wavelet Transform of a Dendrogram by Murtagh, Fionn

“… Finally, a third study explores the wavelet decomposition, and the reproducibility of data sets such as text, including a new perspective on the generation or computability of such data objects…”
Get full text

Lowness for the Class of Schnorr Random Reals by Kjos-Hanssen, Bjorn, Nies, André, Stephan, Frank

“…We answer a question of Ambos-Spies and Kucera in the affirmative. They asked whether, when a real is low for Schnorr randomness, it is already low for Schnorr…”
Get full text

Simulation of simultaneous safe recursion over an arbitrary structure by Xirotiri, Olga

“…In [O. Bournez, F. Cucker, P.J. de Naurois, J.Y. Marion, Computability over an arbitrary structure…”
Get full text

An impossibility about failure detectors in the iterated immediate snapshot model by Rajsbaum, Sergio, Raynal, Michel, Travers, Corentin

“…The Iterated Immediate Snapshot model (IIS) is an asynchronous computation model where processes communicate through a sequence of one-shot Immediate Snapshot…”
Get full text

Macro Tree Translations of Linear Size Increase are MSO Definable by Engelfriet, Joost, Maneth, Sebastian

“…The first main result is that if a macro tree translation is of linear size increase, i.e., if the size of every output tree is linearly bounded by the size of…”
Get full text

Randomness and Recursive Enumerability by Kucera, Antonín, Slaman, T.

Get full text

A note on atomicity: Boosting Test&Set to solve consensus by Imbs, Damien, Raynal, Michel

“…This short note shows how a simple extension of object types with consensus number 2 boosts them to an infinite consensus number. This extension is a simple…”
Get full text