We first show that the Halting Function (the noncomputable function that solves the Halting Problem) has explicit expressions in the language of calculus. Out of that fact we elab...
The complexity of infinite words is considered from the point of view of a transformation with a Mealy machine that is the simplest model of a finite automaton transducer. We are ...
For a graph G, let P(G; ) be its chromatic polynomial and let [G] be the set of graphs having P(G; ) as their chromatic polynomial. We call [G] the chromatic equivalence class of ...
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, ...
We empirically compare five different publicly-available phrase sets in two large-scale (N = 225 and N = 150) crowdsourced text entry experiments. We also investigate the impact ...
Most information retrieval settings, such as web search, are typically precision-oriented, i.e. they focus on retrieving a small number of highly relevant documents. However, in sp...