2009/11/10 by J.A. Bergstra, Bergstra, J. A., C.A. Middelburg +1
Computer Science · #Computability, Logic, AI Algorithms #F.1.1 #F.4.1 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #Programming Languages (cs.PL) #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0911.1851
openalex publication_date 2009/11/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Interaction with services provided by an execution environment forms part of the behaviours exhibited by instruction sequences under execution. Mechanisms related to the kind of interaction in question have been proposed in the setting of thread algebra. Like thread, service is an abstract behavioural concept. The concept of a functional unit is similar to the concept of a service, but more concrete. A state space is inherent in the concept of a functional unit, whereas it is not inherent in the concept of a service. In this paper, we establish the existence of a universal computable functional unit for natural numbers and related results.