Barry S. Cooper – författare

This volume arises directly out of the activities of the INTAS-RFBR Research Project, which is scheduled to run from December 1999 to November 2002. Participating scientists are leading scholars in their fields, and their contributions make this book an excellent, up-to-date account of recent and in some cases as yet unpublished achievements in the field of Computability Theory and its Applications.

Science involves descriptions of the world we live in. It also depends on nature exhibiting what we can best describe as a high aLgorithmic content. The theme running through this collection of papers is that of the interaction between descriptions, in the form of formal theories, and the algorithmic content of what is described, namely of the modeLs of those theories. This appears most explicitly here in a number of valuable, and substantial, contributions to what has until recently been known as 'recursive model theory' - an area in which researchers from the former Soviet Union (in particular Novosibirsk) have been pre-eminent. There are also articles concerned with the computability of aspects of familiar mathematical structures, and - a return to the sort of basic underlying questions considered by Alan Turing in the early days of the subject - an article giving a new perspective on computability in the real world. And, of course, there are also articles concerned with the classical theory of computability, including the first widely available survey of work on quasi-reducibility. The contributors, all internationally recognised experts in their fields, have been associated with the three-year INTAS-RFBR Research Project "Com­ putability and Models" (Project No. 972-139), and most have participated in one or more of the various international workshops (in Novosibirsk, Heidelberg and Almaty) and otherresearch activities of the network.

Published in honor of Dr. John Yuille's career as a Forensic Psychologist, this book offers integrative models of eyewitness memory, investigative interviewing and his Step Wise Interview Protocol, and credibility assessment using Statement Validity Analysis.

Contingent on funding being available, a Festschrift will be held in honor of Dr. John Yuille’s career as a Forensic Psychologist. He has become one of the most visible and respected Canadian psychologists worldwide. In light of his upcoming retirement in December 2006, the Festschrift will recognize Dr. Yuille’s achievements in the areas of eyewitness memory research (i.e., pioneering a new research paradigm that grants better validity), investigative interviewing (i.e., the development and use of the Step Wise Interview Protocol), and credibility assessment (i.e., introducing Statement Validity Analysis to North America). New directions for future work will be explored at the workshop. The focus of this Festschrift will be three-fold:1. International. Dr. Yuille’s work has influenced law enforcement practices and stimulated research in and outside of Canada. The international and multicultural aspects of the work that Dr. Yuille has inspired will be reflected and promoted by this workshop.2. Interdisciplinary. Dr. Yuille is internationally known as an expert, consultant and trainer to law enforcement. As such, Dr. Yuille’s work has also influenced other disciplines, e.g., the law, social work, oral history. The participants of this Festschrift will gain insight into other professionals’ perspectives and foster potential collaborations on future projects.3. Emphasis on applied research. A hallmark of Dr. Yuille’s research has been the application of field and archival methods, which made his work directly applicable to forensically relevant contexts. The potential future directions of applied forensic research will be discussed at this Festschrift.The importance of the subject at this time:- A lack of integrative models in the literatures of eyewitness memory and the assessment of truthfulness and deception. Presenters of the Festschrift have recently developed such models and will discuss them at theFestschrift. Publishing these models and their discussions will spark further research to validate or modify them.- New, pioneering field research based on such integrative models has recently been conducted. This book would be one of the first publications of the results.

CiE 2005: New Computational Paradigms http://www. illc. uva. nl/CiE/ ThecooperationComputabilityinEurope (CiE)isaninformalEuropeannetwork covering computability in theoretical computer science and mathematical logic, ranging from application of novel approaches to computation to set-theoretic analysesofin?nitarycomputingmodels. Thecooperationconsistsofelevenmain nodesandincludesover400researchers;itiscoordinatedfromLeeds(UK). More information about CiE can be found in Barry Cooper's introductory paper to this volume (p. 1) and at http://www. amsta. leeds. ac. uk/pure/staff/cooper/cie. html CiE 2005 was a conference on the special topic "New Computational Pa- digms" and was held in Amsterdam in June 2005. It was initiated by and served as a focus point for the informal cooperation CiE. The topic of "New Com- tational Paradigms" covers connections between computation and physical s- tems (e. g. , quantum computation, neural nets, molecular computation) but also higher mathematical models of computation (e. g. , in?nitary computation or real computation). Computability theory is central to large areas of theoretical computer science and mathematical logic.Traditionally, the computational model of the Turing machine (or mathematically equivalent models) has been used to reason about computation or computability. For general computability inquiries (with - bounded resources), the choice of the model of computation hardly matters (this fact is encapsulated in the so-called "Church-Turing thesis"); this could change as soon as questions of e?ciency are investigated.

This book constitutes the refereed proceedings of the Third International Conference on Theory and Applications of Models of Computation, TAMC 2006, held in Beijing, China, in May 2006. The 75 revised full papers presented together with 7 plenary talks were carefully reviewed and selected from 319 submissions. All major areas in computer science, mathematics (especially logic) and the physical sciences particularly with regard to computation and computability theory are addressed.

This book constitutes the refereed proceedings of the 4th International Conference on Theory and Applications of Models of Computation, TAMC 2007, held in Shanghai, China in May 2007. It addresses all major areas in computer science; mathematics, especially logic; and the physical sciences, particularly with regard to computation and computability theory. The papers particularly focus on algorithms, complexity and computability theory.

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.

This book constitutes the refereed proceedings of the 6th International Conference on Theory and Applications of Models of Computation, TAMC 2009, held in Changsha, China in May 2009. The 39 full papers presented together with 7 invited papers as well as 3 plenary talks were selected from 86 submissions. The papers address the three main themes of the conference which were Computability, Complexity, and Algorithms. The conference aimed to bring together researchers with interests in theoretical computer science, algorithmic mathematics, and applications to the physical sciences.

This book constitutes the refereed proceedings of the 9th International Conference on Theory and Applications of Models of Computation, TAMC 2012, held in Beijing, China, in May 2012. The conference was combined with the Turing Lectures 2012, dedicated to celebrating Alan Turing’s unique impact on mathematics, computing, computer science, informatics, morphogenesis, philosophy, and the wider scientific world. Eight Turing Lectures were given at the TAMC 2012.The 40 revised full papers presented together with invited talks were carefully reviewed and selected from 86 submissions. The papers address 4 special sessions at TAMC 2012 which were algorithms and information in networks, complexity and cryptography, models of computing and networking, programming and verification.