Computability

About: Computability is a research topic. Over the lifetime, 2829 publications have been published within this topic receiving 85162 citations.

Efficiency Theory : a Unifying Theory for Information, Computation and Intelligence

Abstract: The paper serves as the first contribution towards the development of the theory of efficiency: a unifying framework for the currently disjoint theories of information, complexity, communication and computation. Realizing the defining nature of the brute force approach in the fundamental concepts in all of the above mentioned fields, the paper suggests using efficiency or improvement over the brute force algorithm as a common unifying factor necessary for the creation of a unified theory of information manipulation. By defining such diverse terms as randomness, knowledge, intelligence and computability in terms of a common denominator we are able to bring together contributions from Shannon, Levin, Kolmogorov, Solomonoff, Chaitin, Yao and many others under a common umbrella of the efficiency theory.

Computability by finite automata and Pisot bases

Abstract: We prove that the function of normalization in base θ, which maps any θ-representation of a real number onto its θ-development, obtained by a greedy algorithm, is a function computable by a finite automaton over any alphabet if and only if θ is a Pisot number.

A short overview on modern parallel SAT-solvers

Abstract: This paper surveys modern parallel SAT-solvers It focusses on recent successful techniques and points out weaknesses that have to be overcome to exploit the full power of modern multi-core processors

Almost optimal strategies in one clock priced timed games

Abstract: We consider timed games extended with cost information, and prove computability of the optimal cost and of e-optimal memoryless strategies in timed games with one clock. In contrast, this problem has recently been proved undecidable for timed games with three clocks.