In most models of computation, a device performs some type of process, and only some final output is regarded as the result. In adding an observer to such a device, one can obtain a protocol of the entire process and then use this as the computation’s result. In a series of articles this approach has proved to often exceed greatly the power of the system observed. Here we apply this architectur...

Conversation analysts have sometimes been taken to task for apparently choosing not to deal with the "context" of the conversational activities they examine (Cicourel, 1981). In Talking Culture Moerman (1988) describes a blend of ethnography and conversation analysis, and suggests that ethnography describes contextual data extrinsic to interaction while conversation analysis provides non-contex...

Here, we introduce TOPStrings (TOPS+), a highly abstract string-based model of protein topology which permits efficient computation of structure comparison, and can optionally represent ligand information. In this model we consider loops as secondary structure elements (SSEs) as well as helices and strands; in addition we represent ligands as first class objects. Interactions between SSEs, and ...

Conventional models of exemplar or rule-based concept learning tend to focus on the acquisition of one concept at a time. They often underemphasize the fact that we learn many concepts as part of large systems rather than as isolated individuals. In such cases, the challenge of learning is not so much in providing stand-alone definitions, but in describing the richly structured relations betwee...

In this paper we design a syntax deenition formalism as a family of formalisms. Starting with a small kernel, various features for syntax de-nition are designed orthogonally to each other. This provides a framework for constructing new formalisms by adapting and extending old ones. The formalism is developed with the algebraic speciication formalism Asf+Sdf. It provides the following features: ...

The documentation of (unbounded-len~h) copying and cross-serial constructions in a few languages in the recent literature is usually taken to mean that natural languages are slightly context-sensitive. However, this ignores those copying constructions which, while productive, cannot be easily shown to apply to infinite sublanguages. To allow such finite copying constructions to be taken into ac...

This paper describes experiences from implementing key parts of a compiler for Modelica, an object-oriented language supporting declarative modeling and simulation of complex physical systems. Our implementation uses the attribute-grammar based tool JastAdd. In particular, we discuss the implementation of Modelica name analysis which is highly context-dependent, type analysis which is based on ...

Mandarin Chinese is a highly flexible and context-sensitive language. It is difficult to do the case marking and index assignment during the parsing of Chinese sentences. This paper proposes a logic-based Government-Binding approach to treat this problem. The grammar formalism is specified in a formal way. Uniform treatments of movements, arbitrary number of movement non-terminals, automatic de...

We present a method for evaluating the welfare of a decision maker, based on observed choice data. Unlike the standard economic theory of revealed preference, our method is can be used whether or not the observed choices are rational. Paralleling the standard theory we present a model for choice such that the observations arise "as if" they were the result of a speci…c decision making process. ...