Subrecursive Programming Systems

This volume opens up new perspectives on the physics of the Earth's interior for graduate students and researchers working in the fields of geophysics and geodesy. It looks at our planet in an integrated fashion, linking the physics of its interior to the geophysical and geodetic techniques that record, over a broad spectrum of spatial wavelengths, the ongoing modifications in the shape and gravity field of the planet. Basic issues related to the rheological properties of the Earth's mantle and to its slow deformation will be understood, in both mathematical and physical terms, within the framework of an analytical normal mode relaxation theory. Fundamentals of this theory are developed in the first, tutorial part. The second part deals with a wide range of applications, ranging from changes in the Earth's rotation to post-seismic deformation and sea-level variations induced by post-glacial rebound. In the study of the physics of the Earth's interior, the book bridges the gap between seismology and geodynamics.

This volume provides a forum which highlights new achievements and overviews of recent developments of the thriving logic groups in the Asia-Pacific region. It contains papers by leading logicians and also some contributions in computer science logics and philosophic logics. Contents:An Analogy Between Cardinal Characteristics and Highness Properties of Oracles (Jörg Brendle, Andrew Brooke-Taylor, Keng Meng Ng and André Nies)A Non-Uniformly C-Productive Sequence & Non-Constructive Disjunctions (John Case, Michael Ralston and Yohji Akama)Minimal Pairs in the C. E. Truth-Table Degrees (Rod Downey and Keng Meng Ng)A Survey on Recent Results on Partial Learning (Ziyuan Gao, Sanjay Jain, Frank Stephan and Sandra Zilles)Characterization of the Second Homology Group of a Stationary Type in a Stable Theory (John Goodrick, Byunghan Kim and Alexei Kolesnikov)Some Questions Concerning Ab Initio Generic Structures (Koichiro Ikeda)Model Complete Generic Structures (Koichiro Ikeda and Hirotaka Kikyo)On Categorical Relationship among Various Fuzzy Topological Systems, Fuzzy Topological Spaces and Related Algebraic Structures (Purbita Jana and Mihir K Chakraborty)Realizability and Existence Property of a Constructive Set Theory with Types (Farida Kachapova)Goal-Directed Unbounded Coalitional Game and Its Complexity (Hu Liu)On Extensions of Basic Propositional Logic (Minghui Ma and Katsuhiko Sano)Large Cardinals and Higher Degree Theory (Xianghui Shi)Degree Spectra of Equivalence Relations (Liang Yu) Readership: Researchers in mathematical logic and algebra, computer scientists in artificial intelligence and fuzzy logic. Key Features:The Asian Logic Conference is the most significant logic meeting outside of North America and EuropeThe contributors are prominent logicians or young leading researchersSome papers propose a few new questions or new research topicsKeywords:Mathematical Logic;Recursion Theory;Axiomatic Set Theory;Model Theory;Computability;Degree;Forcing;Large Cardinal;Generic Structure;Algebraic Structure;Philosophic Logic

In 1965 Juris Hartmanis and Richard E. Stearns published a paper "On the Computational Complexity of Algorithms". The field of complexity theory takes its name from this seminal paper and many of the major concepts and issues of complexity theory were introduced by Hartmanis in subsequent work. In honor of the contribution of Juris Hartmanis to the field of complexity theory, a special session of invited talks by Richard E. Stearns, Allan Borodin and Paul Young was held at the third annual meeting of the Structure in Complexity conference, and the first three chapters of this book are the final versions of these talks. They recall intellectual and professional trends in Hartmanis' contributions. All but one of the remainder of the chapters in this volume originated as a presentation at one of the recent meetings of the Structure in Complexity Theory Conference and appeared in preliminary form in the conference proceedings. In all, these expositions form an excellent description of much of contemporary complexity theory.

Massively Parallel Systems (MPSs) with their scalable computation and storage space promises are becoming increasingly important for high-performance computing. The growing acceptance of MPSs in academia is clearly apparent. However, in industrial companies, their usage remains low. The programming of MPSs is still the big obstacle, and solving this software problem is sometimes referred to as one of the most challenging tasks of the 1990's. The 1994 working conference on "Programming Environments for Massively Parallel Systems" was the latest event of the working group WG 10.3 of the International Federation for Information Processing (IFIP) in this field. It succeeded the 1992 conference in Edinburgh on "Programming Environments for Parallel Computing". The research and development work discussed at the conference addresses the entire spectrum of software problems including virtual machines which are less cumbersome to program; more convenient programming models; advanced programming languages, and especially more sophisticated programming tools; but also algorithms and applications.

This book constitutes the refereed proceedings of the 17th International Symposium Fundamentals of Computation Theory, FCT 2009, held in Wroclaw, Poland in August 2009. The 29 revised full papers were carefully reviewed and selected from 67 submissions. The papers address all current topics in computation theory such as automata and formal languages, design and analysis of algorithms, computational and structural complexity, semantics, logic, algebra and categories in computer science, circuits and networks, learning theory, specification and verification, parallel and distributed systems, concurrency theory, cryptography and cryptograhic protocols, approximation and randomized algorithms, computational geometry, quantum computation and information, bio-inspired computation.

This book constitutes the refereed proceedings of the 17th International Symposium Fundamentals of Computation Theory, FCT 2009, held in Wroclaw, Poland in August 2009. The 29 revised full papers were carefully reviewed and selected from 67 submissions. The papers address all current topics in computation theory such as automata and formal languages, design and analysis of algorithms, computational and structural complexity, semantics, logic, algebra and categories in computer science, circuits and networks, learning theory, specification and verification, parallel and distributed systems, concurrency theory, cryptography and cryptograhic protocols, approximation and randomized algorithms, computational geometry, quantum computation and information, bio-inspired computation.

This book constitutes the refereed proceedings of the Third International Conference on Computability in Europe, CiE 2007, held in Sienna, Italy, in June 2007. The 50 revised full papers presented together with 36 invited papers were carefully reviewed and selected from 167 submissions.