An examination of communication across cultures in news media and at informal/personal levels : with concentration on relations among two South East Asian countries and Australia and those two countries and Germany

In the age of globalisation dominated by mass communication, the flow of information contributes to a big extent to the worldviews of its "global citizens". From this point of view the mass media can be seen as one of the most salient sources of cross-cultural communication. This study investigates mass communication across cultures, focusing on South East Asia (Malaysia and Singapore), Australia and Germany. The centre of attention is the Western media coverage of South East Asia and vice versa. In this context a content analysis of newspapers of the three regions has been conducted. In addition, working practices and conditions of Western foreign correspondents in South East Asia have been examined. Apart from the investigation of inter-cultural media coverage, another focus of attention will be the examination of two levels of communication: The business level, concentrating on issues like e.g. the Asian business etiquette; and the private level, looking into the transition to a different culture from the perspective of Australian and German expatriates. Apart from investigating mass communication across cultures and to provide a written analysis of the findings, a series of radio documentaries in English and in German has been produced. They cover the following issues: Foreign correspondents in South East Asia, the expatriate-lifestyle of Australians and Germans in South East Asia, business etiquette in Asia, student exchange Germany-Asia, image and prejudices East-West and Tourism.

Some applications of logic to feasibility in higher types

While it is commonly accepted that computability on a Turing machine in polynomial time represents a correct formalization of the notion of a feasibly computable function, there is no similar agreement on how to extend this notion on functionals, that is, what functionals should be considered feasible. One possible paradigm was introduced by Mehlhorn, who extended Cobham's definition of feasible functions to type 2 functionals. Subsequently, this class of functionals (with inessential changes of the definition) was studied by Townsend who calls this class POLY, and by Kapron and Cook who call the same class basic feasible functionals. Kapron and Cook gave an oracle Turing machine model characterisation of this class. In this article, we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalise the corresponding properties of the class of feasible functions, thus giving further evidence that the notion of feasibility of functionals mentioned above is correctly chosen. We also improve the Kapron and Cook result on machine representation.Our proofs are based on essential applications of logic. We introduce a weak fragment of second order arithmetic with second order variables ranging over functions from NN which suitably characterises basic feasible functionals, and show that it is a useful tool for investigating the properties of basic feasible functionals. In particular, we provide an example how one can extract feasible programs from mathematical proofs that use nonfeasible functions.

Mind change complexity of learning logic programs

The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds for learnability of these classes both from positive facts and from positive and negative facts. Building on Angluin’s notion of finite thickness and Wright’s work on finite elasticity, Shinohara defined the property of bounded finite thickness to give a sufficient condition for learnability of indexed families of computable languages from positive data. This paper shows that an effective version of Shinohara’s notion of bounded finite thickness gives sufficient conditions for learnability with ordinal mind change bound, both in the context of learnability from positive data and for learnability from complete (both positive and negative) data. Let Omega be a notation for the first limit ordinal. Then, it is shown that if a language defining framework yields a uniformly decidable family of languages and has effective bounded finite thickness, then for each natural number m >0, the class of languages defined by formal systems of length <= m: • is identifiable in the limit from positive data with a mind change bound of Omega (power)m; • is identifiable in the limit from both positive and negative data with an ordinal mind change bound of Omega × m. The above sufficient conditions are employed to give an ordinal mind change bound for learnability of minimal models of various classes of length-bounded Prolog programs, including Shapiro’s linear programs, Arimura and Shinohara’s depth-bounded linearly covering programs, and Krishna Rao’s depth-bounded linearly moded programs. It is also noted that the bound for learning from positive data is tight for the example classes considered.