Blum--Type Device--Independent Complexity over Law--Time Semigroups with PFHS--HOQ Structures

Abstract

We develop a machine–independent complexity theory for programs realised as trajectories of “law–time semigroups” on computable metric spaces.

Keywords

• information theory
• computer science
• blum complexity
• blum measures
• device independent complexity
• generalised complexity theory
• law time semigroups
• computable dynamical systems
• computable analysis
• semantic cost models

Identifiers and source records

• DOI
• Works entry
• ORCID