Random reals à la Chaitin with or without prefix-freeness

Mostrar todas las versiones(3)

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 parti...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Becher, V., Grigorieff, S.
Formato: JOUR
Materias:
Algorithmic randomness
Kolmogorov complexity
Omega numbers
Random reals
Function evaluation
Probability
Problem solving
Theorem proving
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03043975_v385_n1-3_p193_Becher
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares