Sciweavers

429 search results - page 33 / 86
» Turing computations on ordinals
Sort
View
BMCBI
2011
14 years 6 months ago
PICS-Ord: Unlimited Coding of Ambiguous Regions by Pairwise Identity and Cost Scores Ordination
Background: We present a novel method to encode ambiguously aligned regions in fixed multiple sequence alignments by ‘Pairwise Identity and Cost Scores Ordination’ (PICS-Ord)....
Robert K. Luecking, Brendan P. Hodkinson, Alexandr...
MST
2002
97views more  MST 2002»
14 years 11 months ago
Programmed Mutagenesis Is Universal
Programmed mutagenesis is a DNA computing system that uses cycles of DNA annealing, ligation, and polymerization to implement programatic rewriting of DNA sequences. We report that...
Julia Khodor, David K. Gifford
VL
2002
IEEE
165views Visual Languages» more  VL 2002»
15 years 4 months ago
Co-Ordination of Multiple External Representations during Java Program Debugging
Java program debugging was investigated in computer science students who used a software debugging environment (SDE) that provided concurrently displayed, adjacent, multiple and l...
Pablo Romero, Rudi Lutz, Richard Cox, Benedict du ...
APAL
2010
125views more  APAL 2010»
14 years 12 months ago
The computable Lipschitz degrees of computably enumerable sets are not dense
The computable Lipschitz reducibility was introduced by Downey, Hirschfeldt and LaForte under the name of strong weak truthtable reducibility [6]. This reducibility measures both t...
Adam R. Day
APAL
2005
88views more  APAL 2005»
14 years 11 months ago
Dependence relations in computably rigid computable vector spaces
Abstract. We construct a computable vector space with the trivial computable automorphism group, but with the dependence relations as complicated as possible, measured by their Tur...
Rumen D. Dimitrov, Valentina S. Harizanov, Andrei ...