
We show that real-number computations in the interval-domain environment are ‘inherently parallel’ in a precise mathematical sense. We do this by reducing computations of the weak parallel-or operation on the Sierpinski domain to computations of the addition operation on the interval domain.
parallelism, interval-domain environment, Higher-type and set recursion theory, Continuous lattices and posets, applications, real-number computations, Semantics in the theory of computing, functional programming, Models of computation (Turing machines, etc.), Functional programming and lambda calculus, ddc: ddc:
parallelism, interval-domain environment, Higher-type and set recursion theory, Continuous lattices and posets, applications, real-number computations, Semantics in the theory of computing, functional programming, Models of computation (Turing machines, etc.), Functional programming and lambda calculus, ddc: ddc:
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 12 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
