Autor(es)

Verónica Becher and Serge Grigorieff

URL Pública

Abstract

We give a general theorem that provides examples of n-random reals à la Chaitin, for every n≥1; these are halting probabilities of partial computable functions that are universal by adjunction for the class of all partial computable functions, The same result holds for the class functions of partial computable functions with prefix-free domain. Thus, the usual technical requirement of prefix-freeness on domains is an option which we show to be non-critical when dealing with universality by adjunction. We also prove that the condition of universality by adjunction (which, though particular, is a very natural case of optimality) is essential in our theorem.