Nijhawan argues that neural compensation is necessary to account for couplings of perception and action. Although perhaps true in some cases, computational tolerance for asynchronously arriving continuous information is of more importance. Moreover, some of the everyday venues Nijhawan uses to argue for the relevance of prediction and compensation can be better ascribed to skill.

The present study aimed to integrate findings from technology acceptance research with research on applicant reactions to new technology for the emerging selection procedure of asynchronous video interviewing. One hundred six volunteers experienced asynchronous video interviewing and filled out several questionnaires including one on the applicants’ personalities. In line with previous technology acceptance research, the data revealed that perceived usefulness and perceived ease of use predicted attitudes toward asynchronous video interviewing. Furthermore, openness revealed to moderate the relation (...) between perceived usefulness and attitudes toward this particular selection technology. No significant effects revealed for computer self-efficacy, job interview self-efficacy, extraversion, neuroticism, and conscientiousness. Theoretical and practical implications are discussed. (shrink)

Among the claims made for online learning is its potential to foster critical thinking, particularly by engaging students in asynchronous discussions conducted in writing. This paper reviews and critiques these claims. It first examines the uses of writing and classroom discussion in modeling and encouraging critical thinking. It then reviews some of the arguments for the possible advantages of online interaction over face-to-face discussion. Finally, it critiques these claims by comparing the specific features, which distinguish the experience of participation (...) in asynchronous written discussions from synchronous oraldiscussion. This comparison illuminates the role of oral discussion in modeling and developing students’ critical thinking skills and points out difficulty of doing so through asynchronous computer-mediated discussions. (shrink)

What are the limits of physical computation? In his ‘Church’s Thesis and Principles for Mechanisms’, Turing’s student Robin Gandy proved that any machine satisfying four idealised physical ‘principles’ is equivalent to some Turing machine. Gandy’s four principles in effect define a class of computing machines (‘Gandy machines’). Our question is: What is the relationship of this class to the class of all (ideal) physical computing machines? Gandy himself suggests that the relationship is identity. We do not share this view. (...) We will point to interesting examples of (ideal) physical machines that fall outside the class of Gandy machines and compute functions that are not Turing-machine computable. (shrink)

To be relevant to the constantly changing work patterns of the real world, effective learning in universities often occurs in small groups facilitated by collaborative environments where participants are dynamically involved in purposeful activities. The research described in this paper is an investigation of purposeful group work devised for experiential learning where a variety of socio-technical tools were used to support asynchronous tasks and communication among the learners. In order to explore the complexity of this collaborative activity a distinctive (...) inductive research approach has been adopted using reflective developmental methods. The data collection and the analysis part of the research involved the reflection of participants on their activity being requested as reports within their course work. Student reports were subject to content analysis using a computer-based tool that creates a conceptual map of collections of documents comparing the ratings and relationships of concepts among different sets of participants. The study was enhanced by the use of Q-methodology that allows the participants to outline their views and to make individual decisions on the relative importance that they place upon the available views of the larger group. Concepts from Activity Theory allowed the researchers to take a holistic contextual approach both to the design of the research and the interpretation of the findings to make some sense of the complexity of the dynamic work-learning dialectic in a socio-technical collaborative setting. (shrink)

This festschrift volume is dedicated to Boris (Boaz) Trakhtenbrot on the occasion of his 85th birthday. For over half a century, Trakhtenbrot has been making seminal contributions to virtually all of the central areas of theoretical computer science. He is universally admired as a founding father and long-standing pillar of the discipline of computer science. On Friday, 28 April 2006, the School of Computer Science at Tel Aviv University held a “Computation Day Celebrating Boaz (Boris) Trakhtenbrot's Eighty-Fifth Birthday”. As (...) a follow-up to that event, his students and colleagues were asked to contribute to a volume in his honor and in recognition of his grand contributions to the field. The book opens with two historical overviews and a bibliography. These are followed by 33 thoroughly reviewed technical contributions. The broad range of topics covered include mathematical logic, logics for computer science, mathematics for computer science, automata and formal languages, asynchronous computation, semantics of programming languages, verification, and software engineering. This tapestry of subjects stands as testimony to the vast scope of Trakhtenbrot's achievements and the profound influence he has had on the field. (shrink)

The increased interactivity and connectivity of computational devices along with the spreading of computational tools and computational thinking across the fields, has changed our understanding of the nature of computing. In the course of this development computing models have been extended from the initial abstract symbol manipulating mechanisms of stand-alone, discrete sequential machines, to the models of natural computing in the physical world, generally concurrent asynchronous processes capable of modelling living systems, their informational structures and dynamics on both symbolic (...) and sub-symbolic information processing levels. Present account of models of computation highlights several topics of importance for the development of new understanding of computing and its role: natural computation and the relationship between the model and physical implementation, interactivity as fundamental for computational modelling of concurrent information processing systems such as living organisms and their networks, and the new developments in logic needed to support this generalized framework. Computing understood as information processing is closely related to natural sciences; it helps us recognize connections between sciences, and provides a unified approach for modeling and simulating of both living and non-living systems. (shrink)

Isolated feedforward networks (FFNs) of spiking neurons have been studied extensively for their ability to propagate transient synchrony and asynchronous firing rates, in the presence of activity independent synaptic background noise (Diesmann et al., 1999; van Rossum et al., 2002). In a biologically realistic scenario, however, the FFN should be embedded in a recurrent network, such that the activity in the FFN and the network activity may dynamically interact. Previously, transient synchrony propagating in an FFN was found to destabilize (...) the dynamics of the embedding network (Mehring et al., 2003). Here, we show that by modeling synapses as conductance transients, rather than current sources, it is possible to embed and propagate transient synchrony in the FFN, without destabilizing the background network dynamics. However, the network activity has a strong impact on the type of activity that can be propagated in the embedded FFN. Global synchrony and high firing rates in the embedding network prohibit the propagation of both, synchronous and asynchronous spiking activity. In contrast, asynchronous low-rate network states support the propagation of both, synchronous spiking and asynchro- nous, but only low firing rates. In either case, spiking activity tends to synchronize as it propagates, challenging the feasibility to transmit information in asynchronous firing rates. Finally, asynchronous network activity allows to embed more than one FFN, with the amount of cross talk depending on the degree of overlap in the FFNs. This opens the possibility of computational mechanisms using transient synchrony among the activities in multiple FFNs. (shrink)

Purpose – Tabletop online role-playing games enable active learning appropriate for different ages and learner capabilities. They have also been implemented in computer and engineering ethics courses. The paper aims to discuss these issues. Design/methodology/approach – This paper presents the experience of implementing role-playing in several courses embedded in Web 2.0 environment, with an intention to confront complex and sometimes mutually conflicting concepts, and integrate them into a whole. Findings – Typical examples introducing two basic scenarios representing individual and collaborative (...) learning scripts are presented together with the detailed analysis how the games were performed, the effort to participate in, and to maintain them. Particular attention is paid to student feedback. Originality/value – The paper concludes with the basic findings of the effects of role-playing in current learning computer ethics and social responsibilities courses, and recommendations for future implementation of similar asynchronous learning online activities in order to increase their academic value and prepare students for their forthcoming professional integration. (shrink)

Technology is not only an object of philosophical reflection but also something that can change this reflection. This paper discusses the potential of computer-supported argument visualization tools for coping with the complexity of philosophical arguments. I will show, in particular, how the interactive and web-based argument mapping software “AGORA-net” can change the practice of philosophical reflection, communication, and collaboration. AGORA-net allows the graphical representation of complex argumentations in logical form and the synchronous and asynchronous collaboration on those “argument maps” (...) on the internet. Web-based argument mapping can overcome limits of space, time, and access, and it can empower users from all over the world to clarify their reasoning and to participate in deliberation and debate. Collaborative and web-based argument mapping tools such as AGORA-net can change the practice of arguing in two dimensions. First, arguing on web-based argument maps in both collaborative and adversarial form can lead to a fundamental shift in the way arguments are produced and debated. It can provide an alternative to the traditional four-step process of writing, publishing, debating, and responding in new writing with its clear distinction between individual and social activities by a process in which these four steps happen virtually simultaneously, and individual and social activities become more closely intertwined. Second, by replacing the linear form of arguments through graphical representations of networks of inferential relations which can grow over time in an infinite space, these tools do not only allow a clear visualization of structures and relations, but also forms of collaboration in which, for example, participants work on different “construction zones” of larger argument maps, or debates are performed at specific points of disagreement on those maps. I introduce the term synergetic logosymphysis to describe a practice that combines these two dimensions of collaborative- and web-based argument mapping. (shrink)

Conventional imagers and almost all vision processes use and rely on theories that are based on the principle of static image-frames. A frame is a 2D matrix that represents the spatial locations of intensities of a scene projected on the imager. The notion of a frame itself is so embedded in machine vision, that it is usually taken for granted that this is how biological systems store light information. This paper presents a biosinpired event-based image formation principle, which output data (...) rely on an asynchronous acquisition process. The generated information is stored in temporal volumes, which size and information depend only on the dynamic content of observed scenes. Practical analysis of such information will shows that the processing of visual information can only be based on a semiotic process. The paper also provides a general definition of the notion of visual features as the interpretation of signs according to different possible readings of the codified visual signal. (shrink)

Online tuition is a practice—practised by this writer—in which students form tutorial relationships with a teacher, and in some models with each other, by the modes of email, Web-mediated file exchange and asynchronous computer conferencing (the construction of multiple threads of conversation and dialogue, as in Web chat rooms). It may centrally revolve around an exchange of assignments and comments. It is quite different from simply referring students to the information and activities on various Web-sites. Centrally, tuition is conducted (...) here in personal interaction through the written word. (shrink)

Online tuition is a practice—practised by this writer—in which students form tutorial relationships with a teacher, and in some models with each other, by the modes of email, Web-mediated file exchange and asynchronous computer conferencing (the construction of multiple threads of conversation and dialogue, as in Web chat rooms). It may centrally revolve around an exchange of assignments and comments. It is quite different from simply referring students to the information and activities on various Web-sites. Centrally, tuition is conducted (...) here in personal interaction through the written word. (shrink)

A gossip protocol is a procedure for sharing secrets in a network. The basic action in a gossip protocol is a pairwise message exchange (telephone call) wherein the calling agents exchange all the secrets they know. An agent who knows all secrets is an expert. The usual termination condition is that all agents are experts. Instead, we explore protocols wherein the termination condition is that all agents know that all agents are experts. We call such agents super experts. We also (...) investigate gossip protocols that are common knowledge among the agents. Additionally, we model that agents who are super experts do not make and do not answer calls, and that this is common knowledge. We investigate conditions under which protocols terminate, both in the synchronous case, where there is a global clock, and in the asynchronous case, where there is not. We show that a commonly known protocol with engaged agents may terminate faster than the same commonly known protocol without engaged agents. (shrink)

A decision delay can translate into significant financial and business losses. One way to accelerate the decision process is through improved communication among the stakeholders engaged in the project. Capturing, transferring, managing, and reusing data, information, and knowledge in the context it is generated can lead to higher productivity, effective communication, reduced number of requests for clarification, and a shorter time-to-market cycle. We formalized the concept of reflection in interaction during communicative events among multiple project stakeholders. This concept extends Donald (...) Schon’s theory of reflection in action of a single practitioner. We model the observed reflection in interaction with a prototype system called TalkingPaperTM. It is a ubiquitous client-server collaborative environment that facilitates knowledge capture, sharing, and reuse during synchronous and asynchronous communicative events. TalkingPaperTM bridges the paper and digital worlds. It transforms the analog verbal discours, annotated paper corporate documents, and the paper and pencil sketches into indexed and synchronized digital content that is published on and streamed on-demand from a TalkingPaperTM web server. The TalkingPaperTM sessions can be accessed by all stakeholders for rapid knowledge sharing and decision-making. (shrink)

More and more frequently, the organisation of design fits into a project organisation where different designers have to cooperate with flexibility and reactivity. In order to help these cooperative design processes, we have to respond to new types of needs: a relatively unformalised coordination that requires permanent mutual adjustment, the fact that members of the team are geographically distant, the difficulty of building a shared reference via design documents and technical and organisational decisions that structure the project. In order to (...) provide computer support for these needs, asynchronous Group Ware is often recommended. However, the efficiency of these tools depends on the models that structure the work processes and the knowledge exchanged. In this paper, we present ABRICo, a new Design Rationale formalism that permits the recording of cooperative decision-making processes in complex design situations. We describe the formalism and explain how we intend to use it to specify cooperative design tools usable via an Intranet for computing projects. (shrink)

La communication par ordinateur est de plus en plus utilisée comme soutien pour les cours universitaires conventionnels. Cet article offre un panorama d'une série d'études fines d'innovation à petite échelle dans diverses disciplines sur deux campus universitaires britanniques. La plupart impliquait des interactions textuelles asynchrones concernant tous les étudiants et tous les tuteurs d'un cours. Des observations, des questionnaires et des entretiens ont servi à établir des configurations de décollage et d'usage des nouveaux médias pour la discussion. Les résultats sont (...) discutés selon les cinq « règles de virtualité » .Computer-based communication is increasingly being used in support of conventional university courses. This paper offers an overview of a series of detailed studies of small scale innovations across a range of disciplines at two campus-based UK universities. Most involved asynchronous, text-based interactions involving all students on a given course and the tutor or tutors involved. Observations, questionnaires and interviews were used to establish patterns of uptake and use of the new discussion media. Findings are discussed in terms of five "rules of virtuality". (shrink)

This is a case-study in knowledge representation and dynamic epistemic protocol verification. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents know, how their knowledge changes due to observations, and how they affect the state of the world by changing facts, i.e., by their actions. These actions depend on the history of previous actions and observations. Part of its interest is that all actions are local, i.e. not publicly observable, and (...) part of the problem is therefore how to disseminate local results to other agents, and make them global. The various solutions to the puzzle are presented as protocols. The paper consists of three parts. First, we present different versions of the puzzle, and their solutions. This includes a probabilistic version, and a version assuming synchronicity. The latter is very informative for the prisoners, and allows different protocols. Then, we model the puzzle in an epistemic logic incorporating dynamic operators for the effects of information changing events. Such events include both informative actions, where agents become more informed about the non-changing state of the world, and factual changes, wherein the world and the facts describing it change themselves as well. Finally, we verify the basic protocol to solve the problem. Novel contributions in this paper are: Firstly, Protocol 2 and Protocol 4. Secondly, the modelling in dynamic epistemic logic in its entirety — we do not know of a case study that combines factual and informational dynamics in a setting of non-public events, or of a similar proposal to handle asynchronous behaviour in a dynamic epistemic logic. Thirdly, our method to verify dynamic epistemic protocols by reasoning over possibly infinite execution sequences of these protocols. A precursor of the present paper, entitled ‘One hundred prisoners and a lightbulb – logic and computation’, was presented at KR 2010, Toronto. The differences with the present contribution are as follows: the former contains a section with computational results, whereas the focus of the present paper is the verification of one of the presented protocols in the former. (shrink)

Data Transfer Service (DTS) is an open-source project that is developing a document-centric message model for describing a bulk data transfer activity, with an accompanying set of loosely coupled and platform-independent components for brokering the transfer of data between a wide range of (potentially incompatible) storage resources as scheduled, fault-tolerant batch jobs. The architecture scales from small embedded deployments on a single computer to large distributed deployments through an expandable ‘worker-node pool’ controlled through message-orientated middleware. Data access and transfer efficiency (...) are maximized through the strategic placement of worker nodes at or between particular data sources/sinks. The design is inherently asynchronous, and, when third-party transfer is not available, it side-steps the bandwidth, concurrency and scalability limitations associated with buffering bytes directly through intermediary client applications. It aims to address geographical–topological deployment concerns by allowing service hosting to be either centralized (as part of a shared service) or confined to a single institution or domain. Established design patterns and open-source components are coupled with a proposal for a document-centric and open-standards-based messaging protocol. As part of the development of the message protocol, a bulk data copy activity document is proposed for the first time. (shrink)

Adopting the perspective of another person is an important aspect of social cognition and has been shown to depend on multisensory signals from one’s own body. Recent work suggests that interoceptive signals not only contribute to own-body perception and self-consciousness, but also to empathy. Here we investigated if social cognition – in particular adopting the perspective of another person – can be altered by a systematic manipulation of interoceptive cues and further, if this effect depends on empathic ability. The own-body (...) transformation task – wherein participants are instructed to imagine taking the perspective and position of a virtual body presented on a computer screen – offers an effective way to measure reaction time differences linked to the mental effort of taking an other’s perspective. Here, we adapted the OBT with the flashing of a silhouette surrounding the virtual body, either synchronously or asynchronously with the timing of participants’ heartbeats. We evaluated the impact of this cardio-visual synchrony on reaction times and accuracy rates in the OBT. Empathy was assessed with the empathy quotient questionnaire. Based on previous work using the cardio-visual paradigm, we predicted that synchronous cardio-visual stimulation would increase self-identification with the virtual body and facilitate participants’ ability to adopt the virtual body’s perspective, thereby enhancing performance on the task, particularly in participants with higher empathy scores. We report that participants with high empathy showed significantly better performance during the OBT task during synchronous versus asynchronous cardio-visual stimulation. Moreover, we found a significant positive correlation between empathic ability and the synchrony effect. We conclude that synchronous cardio-visual stimulation between the participant’s body and a virtual body during an OBT task makes it easier to adopt the virtual body’s perspective, presumably based on multisensory integration processes. However, this effect depended on empathic ability, suggesting that empathy, interoception and social perspective taking are inherently linked. (shrink)

The study considers the development of methods for detecting anomalous network connections based on hybridization of computational intelligence methods. An analysis of approaches to detecting anomalies and abuses in computer networks. In the framework of this analysis, a classification of methods for detecting network attacks is proposed. The main results are reduced to the construction of multi-class models that increase the efficiency of the attack detection system, and can be used to build systems for classifying network parameters during the attack. (...) A model of an artificial immune system based on an evolutionary approach, an algorithm for genetic-competitive learning of the Kohonen network and a method of hierarchical hybridization of binary classifiers with the addition to the detection of anomalous network connections have been developed. The architecture of the network distributed attack detection system has been developed. The architecture of the attack detection system is two-tier: the first level provides the primary analysis of individual packets and network connections using signature analysis, the second level processes the processing of aggregate network data streams using adaptive classifiers. A signature analysis was performed to study network performance based on the Aho-Korasik and Boyer-Moore algorithms and their improved analogues were implemented using OpenMP and CUDA technologies. The architecture is presented and the main points of operation of the network attack generator are shown. A system for generating network attacks has been developed. This system consists of two components: an asynchronous transparent proxy server for TCP sessions and a frontend interface for a network attack generator. The results of the experiments confirmed that the functional and non-functional requirements, as well as the requirements for computing intelligent systems, are met for the developed attack detection system. (shrink)

In this paper, I will argue for the relevance of certain distinctive features of messaging systems, namely those in which data can be sent and received asynchronously, can be sent to multiple simultaneous recipients and is received as a “potentially infinite” flow of unpredictable events. I will describe the social technology of the stock ticker, a telegraphic device introduced at the New York Stock Exchange in the 1860s, with reference to early twentieth century philosophers of synchronous experience, simultaneous sign interpretations, (...) and flows of discrete events. Then, I will show how the ticker’s data flows developed into the 1990s-era technologies of message queues and message brokers, which distinguished themselves through their asynchronous implementation of ticker-like message feeds sent between otherwise incompatible computers and terminals. These latter systems’ characteristic “publish/subscribe” communication pattern was one in which conceptually centralized flows of messages would be “published,” and for which “subscribers” would be spontaneously notified when events of interest occurred. This paradigm—common to the so-called “message-oriented middleware” systems of the late 1990s—would re-emerge in different asynchronous distributed system contexts over the following decades, from “push media” to Twitter to the Internet of Things. (shrink)

In this paper, I will argue for the relevance of certain distinctive features of messaging systems, namely those in which data can be sent and received asynchronously, can be sent to multiple simultaneous recipients and is received as a “potentially infinite” flow of unpredictable events. I will describe the social technology of the stock ticker, a telegraphic device introduced at the New York Stock Exchange in the 1860s, with reference to early twentieth century philosophers of synchronous experience, simultaneous sign interpretations, (...) and flows of discrete events. Then, I will show how the ticker’s data flows developed into the 1990s-era technologies of message queues and message brokers, which distinguished themselves through their asynchronous implementation of ticker-like message feeds sent between otherwise incompatible computers and terminals. These latter systems’ characteristic “publish/subscribe” communication pattern was one in which conceptually centralized flows of messages would be “published,” and for which “subscribers” would be spontaneously notified when events of interest occurred. This paradigm—common to the so-called “message-oriented middleware” systems of the late 1990s—would re-emerge in different asynchronous distributed system contexts over the following decades, from “push media” to Twitter to the Internet of Things. (shrink)

In this paper, I will argue for the relevance of certain distinctive features of messaging systems, namely those in which data can be sent and received asynchronously, can be sent to multiple simultaneous recipients and is received as a “potentially infinite” flow of unpredictable events. I will describe the social technology of the stock ticker, a telegraphic device introduced at the New York Stock Exchange in the 1860s, with reference to early twentieth century philosophers of synchronous experience, simultaneous sign interpretations, (...) and flows of discrete events. Then, I will show how the ticker’s data flows developed into the 1990s-era technologies of message queues and message brokers, which distinguished themselves through their asynchronous implementation of ticker-like message feeds sent between otherwise incompatible computers and terminals. These latter systems’ characteristic “publish/subscribe” communication pattern was one in which conceptually centralized flows of messages would be “published,” and for which “subscribers” would be spontaneously notified when events of interest occurred. This paradigm—common to the so-called “message-oriented middleware” systems of the late 1990s—would re-emerge in different asynchronous distributed system contexts over the following decades, from “push media” to Twitter to the Internet of Things. (shrink)

In this paper, I will argue for the relevance of certain distinctive features of messaging systems, namely those in which data can be sent and received asynchronously, can be sent to multiple simultaneous recipients and is received as a “potentially infinite” flow of unpredictable events. I will describe the social technology of the stock ticker, a telegraphic device introduced at the New York Stock Exchange in the 1860s, with reference to early twentieth century philosophers of synchronous experience, simultaneous sign interpretations, (...) and flows of discrete events. Then, I will show how the ticker’s data flows developed into the 1990s-era technologies of message queues and message brokers, which distinguished themselves through their asynchronous implementation of ticker-like message feeds sent between otherwise incompatible computers and terminals. These latter systems’ characteristic “publish/subscribe” communication pattern was one in which conceptually centralized flows of messages would be “published,” and for which “subscribers” would be spontaneously notified when events of interest occurred. This paradigm—common to the so-called “message-oriented middleware” systems of the late 1990s—would re-emerge in different asynchronous distributed system contexts over the following decades, from “push media” to Twitter to the Internet of Things. (shrink)

Predictions concerning postindustrial society include that of workers serving as machine monitors. That concept is explored in this article in respect to faculty in higher education serving as monitors of computers that are executing instructional programs. Questions concerning changes in faculty roles and the control of educational quality are addressed. Alfred Bork’s vision of asynchronous learning systems is elaborated, and that alternative is compared to the concept of machine monitoring. It is concluded that monitoring in higher education is not (...) likely unless student demand for distance learning is great, but in that case, monitoring would be superior to proposals for automated asynchronous learning systems. (shrink)

Network ranging and clock synchronization based on two-way timing stamps exchange mechanism in complex GPS-denied environments is addressed in this paper. An estimator based on the Extended Kalman filter is derived, according to which, the clock skew, clock offset, and ranging information can be jointly estimated. The proposed estimator provides off-line computation by storing the transmitting timing stamps in advance and could be implemented in asymmetrical and asynchronous scenarios. The simulation results show that the proposed estimator achieves a (...) relative good performance than the existed estimators. In addition, a new Bayesian Cramér–Rao Lower Bound is derived. Numerous simulation results show that the proposed estimator meets the B-CRLB. (shrink)

In this paper, an in-depth study of interactive visual communication of network topology through non-line-of-sight congestion control algorithms is conducted to address the real-time routing problem of adapting to dynamic topologies, and a delay-constrained stochastic routing algorithm is proposed to enable packets to reach GB within the delay threshold in the absence of end-to-end delay information while improving network throughput and reducing network resource consumption. The algorithm requires each sending node to select an available relay set based on the location (...) of its neighbor nodes and channel state and computes transfer probabilities for each node in the relay set combining the remaining delay of the packet with the distance from the relay node to GB. Based on the obtained transfer probability and local channel state, the sending node passes the packet to the relay node. The convergence of the algorithm is proved and its performance is verified by simulation. The first part of the algorithm is based on the greedy algorithm to deploy and locate the network flying platform nodes with the goal of efficient coverage of the network flying platform nodes, considering the ground base station services. As the delay on each link varies due to the change of channel state, the source and relay nodes asynchronously update the data generation rate and the pairwise parameters based on the received local information and use the obtained optimal values to pass the packets to GB. (shrink)

Can trust evolve on the Internet between virtual strangers? Recently, Pettit answered this question in the negative. Focusing on trust in the sense of ‘dynamic, interactive, and trusting’ reliance on other people, he distinguishes between two forms of trust: primary trust rests on the belief that the other is trustworthy, while the more subtle secondary kind of trust is premised on the belief that the other cherishes one’s esteem, and will, therefore, reply to an act of trust in kind (‘trust-responsiveness’). (...) Based on this theory Pettit argues that trust between virtual strangers is impossible: they lack all evidence about one another, which prevents the imputation of trustworthiness and renders the reliance on trust-responsiveness ridiculous. I argue that this argument is flawed, both empirically and theoretically. In several virtual communities amazing acts of trust between pure virtuals have been observed. I propose that these can be explained as follows. On the one hand, social cues, reputation, reliance on third parties, and participation in (quasi-) institutions allow imputing trustworthiness to varying degrees. On the other, precisely trust-responsiveness is also relied upon, as a necessary supplement to primary trust. In virtual markets, esteem as a fair trader is coveted while it contributes to building up one’s reputation. In task groups, a hyperactive style of action may be adopted which amounts to assuming (not: inferring) trust. Trustors expect that their virtual co-workers will reply in kind while such an approach is to be considered the most appropriate in cyberspace. In non-task groups, finally, members often display intimacies while they are confident someone else ‘out there’ will return them. This is facilitated by the one-to-many, asynchronous mode of communication within mailing lists. (shrink)

Most philosophers appear to have ignored the distinction between the broad concept of Virtual Machine Functionalism (VMF) described in Sloman&Chrisley (2003) and the better known version of functionalism referred to there as Atomic State Functionalism (ASF), which is often given as an explanation of what Functionalism is, e.g. in Block (1995). -/- One of the main differences is that ASF encourages talk of supervenience of states and properties, whereas VMF requires supervenience of machines that are arbitrarily complex networks of causally (...) interacting (virtual, but real) processes, possibly operating on different time-scales, examples of which include many different procesess usually running concurrently on a modern computer performing various tasks concerned with handling interfaces to physical devices, managing the file system, dealing with security, providing tools, entertainments, and games, and possibly processing research data. Another example of VMF would be the kind of functionalism involved in a large collection of possibly changing socio-economic structures and processes interacting in a complex community, and yet another is illustrated by the kind of virtual machinery involved in the many levels of visual processing of information about spatial structures, processes, and relationships (including percepts of moving shadows, reflections, highlights, optical-flow patterns and changing affordances) as you walk through a crowded car-park on a sunny day: generating a whole zoo of interacting qualia. (Forget solitary red patches, or experiences thereof.) -/- Perhaps VMF should be re-labelled "Virtual MachinERY Functionalism" because the word 'machinery' more readily suggests something complex with interacting parts. VMF is concerned with virtual machines that are made up of interacting concurrently active (but not necessarily synchronised) chunks of virtual machinery which not only interact with one another and with their physical substrates (which may be partly shared, and also frequently modified by garbage collection, metabolism, or whatever) but can also concurrently interact with and refer to various things in the immediate and remote environment (via sensory/motor channels, and possible future technologies also). I.e. virtual machinery can include mechanisms that create and manipulate semantic content, not only syntactic structures or bit patterns as digital virtual machines do. -/- Please note: Click on the title above or the link below to read the paper. I prefer to keep all my papers freely accessible on my web site so that I can correct mistakes and add improvements. -/- http://www.cs.bham.ac.uk/research/projects/cogaff/misc/vm-functionalism.html -/- This is now part of the Meta-Morphogenesis project: http://www.cs.bham.ac.uk/research/projects/cogaff/misc/meta-morphogenesis.html. (shrink)

There are two main ways to teach a course online: synchronously or asynchronously. In an asynchronous course, students can log on at their convenience and do the course work. In a synchronous course, there is a requirement that all students be online at specific times, to allow for a shared course environment. In this article, the author discusses the strengths and weaknesses of synchronous online learning for the teaching of undergraduate philosophy courses. The author discusses specific strategies and technologies (...) he uses in the teaching of online philosophy courses. In particular, the author discusses how he uses videoconferencing to create a classroom-like environment in an online class. (shrink)

This systematic investigation of computation and mental phenomena by a noted psychologist and computer scientist argues that cognition is a form of computation, that the semantic contents of mental states are encoded in the same general way as computer representations are encoded. It is a rich and sustained investigation of the assumptions underlying the directions cognitive science research is taking. 1 The Explanatory Vocabulary of Cognition 2 The Explanatory Role of Representations 3 The Relevance of Computation 4 (...) The Psychological Reality of Programs: Strong Equivalence 5 Constraining Functional Architecture 6 The Bridge from Physical to Symbolic: Transduction 7 Functional Architecture and Analogue Processes 8 Mental Imagery and Functional Architecture 9 Epilogue: What is Cognitive Science the Science of? (shrink)

3rd ed, 2021. A circumscription of the classical theory of computation building up from the Chomsky hierarchy. With the usual topics in formal language and automata theory.

The contribution of the body to cognition and control in natural and artificial agents is increasingly described as “off-loading computation from the brain to the body”, where the body is said to perform “morphological computation”. Our investigation of four characteristic cases of morphological computation in animals and robots shows that the ‘off-loading’ perspective is misleading. Actually, the contribution of body morphology to cognition and control is rarely computational, in any useful sense of the word. We thus distinguish (...) (1) morphology that facilitates control, (2) morphology that facilitates perception and the rare cases of (3) morphological computation proper, such as ‘reservoir computing.’ where the body is actually used for computation. This result contributes to the understanding of the relation between embodiment and computation: The question for robot design and cognitive science is not whether computation is offloaded to the body, but to what extent the body facilitates cognition and control – how it contributes to the overall ‘orchestration’ of intelligent behaviour. (shrink)

The mainstream view in cognitive science is that computation lies at the basis of and explains cognition. Our analysis reveals that there is no compelling evidence or argument for thinking that brains compute. It makes the case for inverting the explanatory order proposed by the computational basis of cognition thesis. We give reasons to reverse the polarity of standard thinking on this topic, and ask how it is possible that computation, natural and artificial, might be based on cognition (...) and not the other way around. (shrink)

To clarify the notion of computation and its role in cognitive science, we need an account of implementation, the nexus between abstract computations and physical systems. I provide such an account, based on the idea that a physical system implements a computation if the causal structure of the system mirrors the formal structure of the computation. The account is developed for the class of combinatorial-state automata, but is sufficiently general to cover all other discrete computational formalisms. The (...) implementation relation is non-vacuous, so that criticisms by Searle and others fail. This account of computation can be extended to justify the foundational role of computation in artificial intelligence and cognitive science. (shrink)

Proposals for quantum computation rely on superposed states implementing multiple computations simultaneously, in parallel, according to quantum linear superposition (e.g., Benioff, 1982; Feynman, 1986; Deutsch, 1985, Deutsch and Josza, 1992). In principle, quantum computation is capable of specific applications beyond the reach of classical computing (e.g., Shor, 1994). A number of technological systems aimed at realizing these proposals have been suggested and are being evaluated as possible substrates for quantum computers (e.g. trapped ions, electron spins, quantum dots, nuclear (...) spins, etc., see Table 1; Bennett, 1995; and Barenco, 1995). The main obstacle to realization of quantum computation is the problem of interfacing to the system (input, output) while also protecting the quantum state from environmental decoherence. If this problem can be overcome, then present day classical computers may evolve to quantum computers. (shrink)

Turing computation over a non-linguistic domain presupposes a notation for the domain. Accordingly, computability theory studies notations for various non-linguistic domains. It illuminates how different ways of representing a domain support different finite mechanical procedures over that domain. Formal definitions and theorems yield a principled classification of notations based upon their computational properties. To understand computability theory, we must recognize that representation is a key target of mathematical inquiry. We must also recognize that computability theory is an intensional enterprise: (...) it studies entities as represented in certain ways, rather than entities detached from any means of representing them. (shrink)

One recursively enumerable real α dominates another one β if there are nondecreasing recursive sequences of rational numbers (a[n] : n ∈ ω) approximating α and (b[n] : n ∈ ω) approximating β and a positive constant C such that for all n, C(α − a[n]) ≥ (β − b[n]). See [R. M. Solovay, Draft of a Paper (or Series of Papers) on Chaitin’s Work, manuscript, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1974, p. 215] and [G. J. (...) Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350–359]. We show that every recursively enumerable random real dominates all other recursively enumerable reals. We conclude that the recursively enumerable random reals are exactly the Ω-numbers [G. J. Chaitin, IBM J. Res. Develop., 21 (1977), pp. 350–359]. Second, we show that the sets in a universal Martin-Lof test for randomness have random measure, and every recursively enumerable random number is the sum of the measures represented in a universal Martin-Lof test. (shrink)

The journal of Cognitive Computation is defined in part by the notion that biologically inspired computational accounts are at the heart of cognitive processes in both natural and artificial systems. Many studies of various important aspects of cognition (memory, observational learning, decision making, reward prediction learning, attention control, etc.) have been made by modelling the various experimental results using ever-more sophisticated computer programs. In this manner progressive inroads have been made into gaining a better understanding of the many components (...) of cognition. Concomitantly in both science and science fiction the hope is periodically re-ignited that a manmade system can be engineered to be fully cognitive and conscious purely in virtue of its execution of an appropriate computer program. However, whilst the usefulness of the computational metaphor in many areas of psychology and neuroscience is clear, it has not gone unchallenged and in this article I will review a group of philosophical arguments that suggest either such unequivocal optimism in computationalism is misplaced—computation is neither necessary nor sufficient for cognition—or panpsychism (the belief that the physical universe is fundamentally composed of elements each of which is conscious) is true. I conclude by highlighting an alternative metaphor for cognitive processes based on communication and interaction. (shrink)

The emerging contemporary natural philosophy provides a common ground for the integrative view of the natural, the artificial, and the human-social knowledge and practices. Learning process is central for acquiring, maintaining, and managing knowledge, both theoretical and practical. This paper explores the relationships between the present advances in understanding of learning in the sciences of the artificial, natural sciences, and philosophy. The question is, what at this stage of the development the inspiration from nature, specifically its computational models such as (...) info-computation through morphological computing, can contribute to machine learning and artificial intelligence, and how much on the other hand models and experiments in machine learning and robotics can motivate, justify, and inform research in computational cognitive science, neurosciences, and computing nature. We propose that one contribution can be understanding of the mechanisms of ‘learning to learn’, as a step towards deep learning with symbolic layer of computation/information processing in a framework linking connectionism with symbolism. As all natural systems possessing intelligence are cognitive systems, we describe the evolutionary arguments for the necessity of learning to learn for a system to reach humanlevel intelligence through evolution and development. The paper thus presents a contribution to the epistemology of the contemporary philosophy of nature. (shrink)

Although computation and the science of physical systems would appear to be unrelated, there are a number of ways in which computational and physical concepts can be brought together in ways that illuminate both. This volume examines fundamental questions which connect scholars from both disciplines: is the universe a computer? Can a universal computing machine simulate every physical process? What is the source of the computational power of quantum computers? Are computational approaches to solving physical problems and paradoxes always (...) fruitful? Contributors from multiple perspectives reflecting the diversity of thought regarding these interconnections address many of the most important developments and debates within this exciting area of research. Both a reference to the state of the art and a valuable and accessible entry to interdisciplinary work, the volume will interest researchers and students working in physics, computer science, and philosophy of science and mathematics. (shrink)

This book constitutes the strictly refereed post-workshop proceedings of the 11th International Workshop on Computer Science Logic, CSL '97, held as the 1997 Annual Conference of the European Association on Computer Science Logic, EACSL, in Aarhus, Denmark, in August 1997. The volume presents 26 revised full papers selected after two rounds of refereeing from initially 92 submissions; also included are four invited papers. The book addresses all current aspects of computer science logics and its applications and thus presents the state (...) of the art in the area. (shrink)

Many of our cognitive capacities are shaped by enculturation. Enculturation is the acquisition of cognitive practices such as symbol-based mathematical practices, reading, and writing during ontogeny. Enculturation is associated with significant changes to the organization and connectivity of the brain and to the functional profiles of embodied actions and motor programs. Furthermore, it relies on scaffolded cultural learning in the cognitive niche. The purpose of this paper is to explore the components of symbol-based mathematical practices. Phylogenetically, these practices are the (...) result of concerted organism-niche interactions that have led from approximate number estimations to the emergence of discrete, symbol-based mathematical operations. Ontogenetically, symbol-based mathematical practices are associated with plastic changes to neural circuitry, action schemata, and motor programs. It will be suggested that these practices rely on previously acquired capacities such as subitizing and counting. With these considerations in place, I will argue that computations, understood in the sense of Turing (1936), are a specific kind of symbol-based mathematical practices that can be realized by human organisms, machines, or by hybrid organism-machine systems. In sum, this paper suggests a new way to think about mathematical cognition and computation. (shrink)

To compute is to execute an algorithm. More precisely, to say that a device or organ computes is to say that there exists a modelling relationship of a certain kind between it and a formal specification of an algorithm and supporting architecture. The key issue is to delimit the phrase of a certain kind. I call this the problem of distinguishing between standard and nonstandard models of computation. The successful drawing of this distinction guards Turing's 1936 analysis of (...) class='Hi'>computation against a difficulty that has persistently been raised against it, and undercuts various objections that have been made to the computational theory of mind. (shrink)