
An approach for a simple, general, and unified theory of effectivity on sets with cardinality not greater than that of the continuum is presented. A standard theory of effectivity on \({\mathbb{F}}=\{f:{\mathbb{N}}\to {\mathbb{N}}\}\) has been developed in a previous paper. By representations \(\delta\) :\({\mathbb{F}}\to M\) this theory is extended to other sets M. Topological and recursion theoretical properties of representations are studied, where the final topology of a representation plays an essential role. It is shown that for any separable \(T_ 0\)-space an (up to equivalence) unique admissible representation can be defined which reflects the topological properties correctly.
Higher-type and set recursion theory, type 2 computability, effectivity on sets, admissible representation, final topology of a representation, Computability and recursion theory on ordinals, admissible sets, etc., Theoretical Computer Science, Computer Science(all)
Higher-type and set recursion theory, type 2 computability, effectivity on sets, admissible representation, final topology of a representation, Computability and recursion theory on ordinals, admissible sets, etc., Theoretical Computer Science, Computer Science(all)
| citations 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). | 114 | |
| 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. | Top 10% | |
| 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 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
