Listing 1 - 3 of 3 |
Sort by
|
Choose an application
The workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA’95 in Hagen, Germany, CCA’96 in Trier, Germany, and CCA’98 in Brno, Czech Republic. About 40 participants from the countries United Kingdom, Germany, Japan, Italy, Russia, France, Denmark, Greece, and Ireland contributed to the success of this meeting. Altogether, 28 talkswere p- sented in Swansea. These proceedings include 23 papers which represent a cro- section through recent research on computability and complexity in analysis. The workshop succeeded in bringing together people interested in computability and complexity aspects of analysis and in exploring connections with nume- cal methods, physics and, of course, computer science. It was rounded o by a number of talks and papers on exact computer arithmetic and by a competition of v e implemented systems. A report on this competition has been included in these proceedings. We would like to thank the authors for their contributions and the referees for their careful work, and we hope for further inspiring and constructive meetings of the same kind. April 2001 Jens Blanck Vasco Brattka Peter Hertling Organization CCA2000was hosted by the Department of Computer Science of the University of Wales Swansea and took place on September 17{19, 2000.
Mathematical analysis --- Computable functions --- Computational complexity --- Applied Mathematics --- Engineering & Applied Sciences --- Computability theory --- Functions, Computable --- Partial recursive functions --- Recursive functions, Partial --- 517.1 Mathematical analysis --- Computer science. --- Computer programming. --- Computers. --- Algorithms. --- Mathematical logic. --- Database management. --- Computer Science. --- Computation by Abstract Devices. --- Database Management. --- Programming Techniques. --- Algorithm Analysis and Problem Complexity. --- Mathematical Logic and Formal Languages. --- Mathematical Logic and Foundations. --- Constructive mathematics --- Decidability (Mathematical logic) --- Computer software. --- Logic, Symbolic and mathematical. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Software, Computer --- Computer systems --- Data base management --- Data services (Database management) --- Database management services --- DBMS (Computer science) --- Generalized data management systems --- Services, Database management --- Systems, Database management --- Systems, Generalized database management --- Electronic data processing --- Informatics --- Science --- Algorism --- Algebra --- Arithmetic --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Automatic computers --- Automatic data processors --- Computer hardware --- Computing machines (Computers) --- Electronic brains --- Electronic calculating-machines --- Electronic computers --- Hardware, Computer --- Cybernetics --- Machine theory --- Calculators --- Cyberspace --- Foundations --- Programming --- Mathematical analysis - Congresses --- Computable functions - Congresses --- Computational complexity - Congresses
Choose an application
Informatique theorique --- Logique mathematique --- Algorithmique --- Calculabilite --- Complexite
Choose an application
Informatique theorique --- Logique mathematique --- Algorithmique --- Calculabilite --- Complexite
Listing 1 - 3 of 3 |
Sort by
|