On Complexity of Ehrenfeucht Theories with Computable Model

Show simple item record

dc.contributor.author Gavryushkin, Alexander en
dc.contributor.editor Beckmann, A en
dc.contributor.editor Berger, U en
dc.contributor.editor Löwe, B en
dc.contributor.editor Tucker, J en
dc.coverage.spatial Swansea, Wales, UK en
dc.date.accessioned 2012-03-29T19:25:51Z en
dc.date.issued 2006-06 en
dc.identifier.uri http://hdl.handle.net/2292/16069 en
dc.description.abstract The conference serves as an interdisciplinary forum, which deals with approaches to practical computational problems in many different areas. This includes neural networks, quantum computation, natural computation, molecular computation, computational learning, proof theory, classical computability, computable structures, proof complexity, constructive mathematics, algorithms and bioinformatics. CiE 2006 will have a special focus on logical approaches to computational barriers. Computability in Europe 2006 (CiE 2006), organised by the Department of Computer Science of the University of Wales Swansea, takes place in Swansea, Wales, UK, 30 June - 5 July, 2006. CiE 2006 is the second of a newly evolving series of conferences under the heading Computability in Europe which started 2005 in Amsterdam as CiE 2005: New computational paradigms. Within the CiE series, CiE 2006 will have a particular focus on Logical Approaches to Computational Barriers. In computability many fascinating barriers have been identified. They can be classified into three kinds: the practical and feasible barriers, centred around the P vs. NP problem; the computable barriers connected to models of computers and programming languages; and hypercomputable barriers which lie beyond. These three kinds of barriers can be found in all areas of computability theory: in classical computability theory on discrete data; in computations with continuous data like higher types, real numbers or topological spaces; and in the physical sciences where we find for example quantum computers, analogue computers, and other computing systems based on classical, relativistic and quantum mechanics. Logic provides rigorous formal methods for approaching these barriers. The variety of logical methods ranges from the classical areas of mathematical logic to the newly developed areas in theoretical computer science. Swansea is an ideal place for hosting such a conference. The Department of Computer Science of the University of Wales Swansea is one important member of the CiE network. Together with Wales' beautiful landscape it promises to be an exciting meeting, which gives the opportunity to attend high level scientific talks in a relaxing atmosphere - the beach is only two stone throws away from the campus. en
dc.publisher University of Wales Swansea en
dc.relation.ispartof Computability in Europe 2006. Logical Approaches to Computational Barriers en
dc.relation.ispartofseries Logical Approaches to Computational Barriers (Second Conference on Computability in Europe), Report Series en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.title On Complexity of Ehrenfeucht Theories with Computable Model en
dc.type Conference Item en
pubs.begin-page 105 en
pubs.volume Report # CSR 7-2006 en
dc.rights.holder Copyright: University of Wales Swansea en
pubs.author-url http://www.cs.swan.ac.uk/cie06/ en
pubs.end-page 108 en
pubs.finish-date 2006-07-05 en
pubs.place-of-publication UK en
pubs.start-date 2006-06-30 en
dc.rights.accessrights http://purl.org/eprint/accessRights/RestrictedAccess en
pubs.subtype Conference Paper en
pubs.elements-id 327487 en
pubs.record-created-at-source-date 2012-03-19 en


Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Browse

Statistics