Editorial

Mayordomo, Elvira (Universidad de Zaragoza) ; Merkle, Wolfgang

Resumen: The annual meeting Computability, Complexity and Randomness is worldwide the central conference on algorithmic randomness, an area which in turn has been one of the most central and most fruitful subareas of computability theory for almost two decades now...

Idioma: Inglés

DOI: 10.1007/s00224-015-9620-x

Año: 2015

Publicado en: THEORY OF COMPUTING SYSTEMS 56 (2015), 437-438
ISSN: 1432-4350

Originalmente disponible en: Texto completo de la revista

Factor impacto JCR: 0.719 (2015)

Categ. JCR: MATHEMATICS rank: 118 / 311 = 0.379 (2015) - Q2 - T2
Categ. JCR: COMPUTER SCIENCE, THEORY & METHODS rank: 73 / 105 = 0.695 (2015) - Q3 - T3

Factor impacto SCIMAGO: 0.601 - Theoretical Computer Science (Q2) - Computational Theory and Mathematics (Q3)

Tipo y forma: (PostPrint)

Área (Departamento): Área Lenguajes y Sistemas Inf. (Dpto. Informát.Ingenie.Sistms.)