Timed Sets, Functional Complexity, and Computability
From MaRDI portal
Publication:3178279
DOI10.1016/j.entcs.2012.08.009zbMath1342.68127WikidataQ113318084 ScholiaQ113318084MaRDI QIDQ3178279
Pavel Hrubeš, J. Robin B. Cockett, Joaquín Díaz-Boïls, Jonathan Gallagher
Publication date: 8 July 2016
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2012.08.009
computability; complexity measures; Turing categories; functional complexity; restriction categories
18B99: Special categories
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)