Maurice Schellekens

Learn More
Software agents are involved in Internet applications such as E-commerce and E-government may contain identificatory information about their human user such as credit cards and bank accounts. This paper discusses whether human users and software agents are allowed to be anonymous under the relevant legal regimes and whether an adequate interaction and(More)
The weightable quasi-pseudo-metric spaces have been introduced by Matthews as part of the study of the denotational semantics of dataflow networks (e.g. [Mat92] and [Mat92a]). The study of these spaces has been continued in the context of Nonsymmetric Topology by Kunzi and Vajner ([KV93] and [Kün93]). We introduce and motivate the class of upper weightable(More)
The theory of complexity spaces has been introduced in [Sch95] as part of the development of a topological foundation for Complexity Analysis. The topological study of these spaces has been continued in the context of the theory of upper weightable spaces ([Sch96]), while the specific properties of total boundedness and Smyth completeness have been analyzed(More)
Software agents are involved in Internet applications such as E-commerce and may contain identificatory information about their human user such as credit cards and bank accounts. This paper discusses whether human users and software agents are allowed to be anonymous and whether anonymity is technically realisable from the perspective of Artificial(More)
Software agents extend the current, information-based Internet to include autonomous mobile processing. In most countries such processes, i.e. software agents are, however, without an explicit legal status. Many of the legal implications of their actions (e.g. gathering information, negotiating terms, performing transactions) are not well understood. One(More)
An important characteristic of mobile agents is that they often do not run on their user's platform, but on the platform of someone else. There often is no pre-existing relation between the 'owner' of the running agent's process and the owner of the platform on which the agent process runs. When there are conflicts the position of the owner is not clear: is(More)
The complexity (quasi-pseudo-metric) spaces have been introduced as part of the development of a topological foundation for the complexity analysis of algorithms ((Sch95]). Applications of this theory to the complexity analysis of Divide & Conquer algorithms have been discussed in Sch95]. Typically these applications involve xed point arguments based on the(More)
Software agents extend the current, information-based Internet to include autonomous mobile processing. In most countries such processes, i.e., software agents are, however, without an explicit legal status. Many of the legal implications of their actions (e.g., gathering information, negotiating terms, performing transactions) are not well understood. One(More)