Logic and theory of algorithms : 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008 : proceedings
CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15-20, 2008 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t...
Saved in:
| Main Authors | , , , |
|---|---|
| Format | eBook Book |
| Language | English |
| Published |
Berlin
Springer
2008
Springer Berlin / Heidelberg |
| Edition | 1 |
| Series | Lecture Notes in Computer Science |
| Subjects | |
| Online Access | Get full text |
Cover
Loading…
| Abstract | CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15-20, 2008 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory, or relativity. Computations may be very general, depending on the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning. Applications are everywhere,especially, in algebra,analysisand geometry, or data types and p- gramming. Within CiE there is general recognition of the underlying relevance of computability to physics and a broad range of other sciences, providing as it does a basic analysis of the causal structure of dynamical systems. Thisvolume,Logic andTheory of Algorithms,istheproceedingsofthefourth in a series of conferences of CiE that was held at the University of Athens, June 15-20, 2008. |
|---|---|
| AbstractList | CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15-20, 2008 Computability in Europe (CiE) is an informal network of European scientists working on computability theory, including its foundations, technical devel- ment, and applications. Among the aims of the network is to advance our t- oretical understanding of what can and cannot be computed, by any means of computation. Its scienti?c vision is broad: computations may be performed with discrete or continuous data by all kinds of algorithms, programs, and - chines. Computations may be made by experimenting with any sort of physical system obeying the laws of a physical theory such as Newtonian mechanics, quantum theory, or relativity. Computations may be very general, depending on the foundations of set theory; or very speci?c, using the combinatorics of ?nite structures. CiE also works on subjects intimately related to computation, especially theories of data and information, and methods for formal reasoning about computations. The sources of new ideas and methods include practical developments in areas such as neural networks, quantum computation, natural computation, molecular computation, computational learning. Applications are everywhere,especially, in algebra,analysisand geometry, or data types and p- gramming. Within CiE there is general recognition of the underlying relevance of computability to physics and a broad range of other sciences, providing as it does a basic analysis of the causal structure of dynamical systems. Thisvolume,Logic andTheory of Algorithms,istheproceedingsofthefourth in a series of conferences of CiE that was held at the University of Athens, June 15-20, 2008. |
| Author | Conference on Computability in Europe (4th : 2008 : Athens, Greece) Beckmann, Arnold Dimitracopoulos, Costas Löwe, Benedikt |
| Author_xml | – sequence: 1 fullname: Conference on Computability in Europe (4th : 2008 : Athens, Greece) – sequence: 2 fullname: Beckmann, Arnold – sequence: 3 fullname: Dimitracopoulos, Costas – sequence: 4 fullname: Löwe, Benedikt |
| BackLink | https://cir.nii.ac.jp/crid/1130000795619723904$$DView record in CiNii |
| BookMark | eNpVkE1Lw0AQhiN-YK39D3sQRGhhP5LdxFsNtSoFL-I1TDaTdm26W7OJ0rs_3G3rxTnMzMs8vAzvVXRmncWTaJSpVCQxlVlMlTz9pxN-EQ244oLxRKWX0cj7DxpKsFRmfBD9LNzSaAK2It0KXbsjribQLF1rutXGk3sSdyuSO1tji1YjcTaozbbvoDSN6XbEWDLrW7fFMcnNjHBK0zGZBjPrx2TeIupweektEpZMOB0fiOC7bZ1GrIxd-uvovIbG4-hvDqP3x9lb_jRZvM6f8-liAjGXgk7qsgIGCioQZQpMU8BSlbICmbG4jjGt6xJ0QsOiMpZqyRRPaNCgONYUxDC6OxqDX-O3X7mm88VXg6Vza1_8izGwt0c2PPrZo--KA6bRdi00xewhF1SmCVeBvDmS1phCm31nTOxTVlkiWRbSz2gsfgGxWnpn |
| ContentType | eBook Book |
| DBID | RYH |
| DatabaseName | CiNii Complete |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| DocumentTitleAlternate | CiE 2008 |
| EISBN | 9783540694076 3540694072 |
| Edition | 1 2008 edition. |
| ExternalDocumentID | 9783540694076 EBC3068527 BA86830672 |
| GroupedDBID | 089 0D6 0DA 0E8 2HV 38. A4J AABBV AABFA AAJYQ AATVQ AAUKK ABBUY ABBVZ ABCYT ABGTP ABMNI ACANT ACDTA ACDUY ACHXG ACKTP AEDXK AEHEY AEJLV AEKFX AETDV AEZAY AHNNE ALMA_UNASSIGNED_HOLDINGS ATJMZ AZZ BBABE CZZ E6I IEZ IW- JJU MA. MMI MW~ NUU RYH SBO SVJCK TPJZQ TSXQS Z5O Z7R Z7S Z7U Z7W Z7X Z7Y Z7Z Z81 Z83 Z84 Z85 Z87 Z88 AAFYB -7M -7Q -BG LDH NUC SAO Z7V Z82 Z8R Z8W Z92 |
| ID | FETCH-LOGICAL-a42630-fbda1a7ada3b8a1c0aeb7b6da6914f4e8ffbac50e8f7918c61725050ea72ef0a3 |
| ISBN | 9783540694052 3540694056 |
| IngestDate | Fri Nov 08 03:54:31 EST 2024 Fri May 30 21:52:24 EDT 2025 Fri Jun 27 00:14:24 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| LCCallNum_Ident | QA76.758 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-a42630-fbda1a7ada3b8a1c0aeb7b6da6914f4e8ffbac50e8f7918c61725050ea72ef0a3 |
| Notes | International conference proceedings Includes bibliographical references and index |
| OCLC | 272312578 |
| PQID | EBC3068527 |
| PageCount | 612 |
| ParticipantIDs | askewsholts_vlebooks_9783540694076 proquest_ebookcentral_EBC3068527 nii_cinii_1130000795619723904 |
| PublicationCentury | 2000 |
| PublicationDate | c2008 2008 2008-06-11 |
| PublicationDateYYYYMMDD | 2008-01-01 2008-06-11 |
| PublicationDate_xml | – year: 2008 text: c2008 |
| PublicationDecade | 2000 |
| PublicationPlace | Berlin |
| PublicationPlace_xml | – name: Berlin – name: Berlin, Heidelberg |
| PublicationSeriesTitle | Lecture Notes in Computer Science |
| PublicationYear | 2008 |
| Publisher | Springer Springer Berlin / Heidelberg |
| Publisher_xml | – name: Springer – name: Springer Berlin / Heidelberg |
| SSID | ssj0000318692 |
| Score | 1.8173535 |
| Snippet | CiE 2008: Logic and Theory of Algorithms Athens, Greece, June 15-20, 2008 Computability in Europe (CiE) is an informal network of European scientists working... |
| SourceID | askewsholts proquest nii |
| SourceType | Aggregation Database Publisher |
| SubjectTerms | Algorithms -- Congresses Computable functions Computable functions -- Congresses Computational intelligence -- Congresses Congresses Logic, Symbolic and mathematical -- Congresses |
| TableOfContents | Classical Fractal Dimensions -- Shannon Information Theory -- Effective Fractal Dimensions -- Classical Dimensions of Saturated Sets -- Our Results -- Preliminaries -- The Four Dimensions -- Relative Frequencies of Digits -- Saturated Sets and Maximum Entropy Principle -- Conclusion -- Reachability in Linear Dynamical Systems -- Introduction -- Prerequisites -- Linear Continuous-Time Dynamical Systems -- Polynomials -- Matrices -- Undecidability for Polynomial Dynamical Systems -- Decidability for Linear Dynamical Systems -- To Put the Matrix in Jordan Form -- If the Matrix Is in Jordan Form -- Hybrid Functional Interpretations -- Introduction -- Multi-modal Linear Logic LL^{\omega}_h -- Kreisel and Gödel Modalities -- A Hybrid Functional Interpretation -- Simple Applications to Program Extraction -- Example 1 -- Example 2 -- Example 3 -- Example 4 -- Comparison to Light Dialectica -- The Light Hybrid Interpretation -- Future Work: Extension and Automation -- Automated Decoration of Modalities -- Conclusion -- The Algorithm Concept - Tool for Historiographic Interpretation or Red Herring? -- A Parallel but Preceding Issue -- Seeing Historical Texts through Algorithms -- Algorithmic Analysis -- The Participants' Point of View -- References -- Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion -- Introduction -- Preliminaries -- Schedulers -- Peyton Young's Model of Norm Diffusion -- Stochastic Stability -- Results -- Main Result: Diffusion of Norms by Contagion -- The Inertia of Diffusion of Norms with Contagion -- Conclusions and Acknowledgments -- A Simple P-Matrix Linear Complementarity Problem for Discounted Games -- Introduction -- Discounted Games -- A P-Matrix LCP for Discounted Games -- An LCP for Discounted Games -- The P-Matrix Property -- Understanding q and M -- Algorithms -- Unique Sink Orientations of Cubes Strategy Improvement and the Strategy Valuation USO -- Murty's Least-Index Method -- Further Research -- Implementing Spi Calculus Using Nominal Techniques -- Introduction -- Spi Calculus -- Isabelle/Nominal -- Encoding Spi Calculus in Isabelle/Nominal -- Implementation of Syntax and Semantics -- Implementation of Hedged Bisimulation -- Example: ``Perfect Encryption'' -- Conclusions and Future Work -- An Enhanced Theory of Infinite Time Register Machines -- Introduction -- Infinite Time Register Machines -- Computing \Pi^1_1-Sets -- ITRMs, ITTMs, and Halting Problems -- Many Facets of Complexity in Logic -- Introduction -- The Computational Complexity Setting -- Finite Model Theory and Descriptive Complexity -- Logics between First-Order and Existential Second-Order -- Bounded Arithmetic -- The Language and Translation from the Finite Model Theory Setting -- Systems of Bounded Arithmetic -- Defining Functions in the Bounded Arithmetic Setting -- When Do Systems Based on Formulas Describing a Complexity Class Capture the Same Class? -- Conclusions -- On the Computational Power of Enhanced Mobile Membranes -- Introduction -- Systems with Enhanced Mobile Membranes -- Computational Power -- Conclusion -- Recursion in Higher Types and Resource Bounded Turing Machines -- Introduction -- A Brief Discussion -- Computability and Complexity in Self-assembly -- Introduction -- Preliminaries -- Pseudoseeds and Multiseeds -- Self-assembly of Computably Enumerable Sets -- Overview of Construction -- The Ray Module -- The Planter Module -- The Computation Module -- Sketch of Correctness Proof -- A Decidable Set That Does Not Self-assemble -- Conclusion -- Extraction in Coq: An Overview -- Introduction -- Extraction in Practice : Div -- A Division That Fulfills the Structural Constraint -- A Division with an Explicit Counter Title Page -- Preface -- Table of Contents -- Deterministic Graphical Games Revisited -- Introduction -- Simple Stochastic Games -- Deterministic Graphical Games -- Our Results -- Preliminaries -- Solving Deterministic Graphical Games -- Strongly -- Weakly -- Program Schemes with Deep Pushdown Storage -- Introduction -- Basic Definitions -- Our Results -- Restricted Program Schemes -- Capturing NP -- Beyond NP -- Capturing PSPACE -- Beyond PSPACE -- Conclusions -- Herbrand Theorems and Skolemization for Prenex Fuzzy Logics -- Introduction -- Fuzzy Logics -- Herbrand Theorems -- Approximate Herbrand Theorems -- Skolemization -- Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL -- Introduction -- Preliminaries, Definitions, Notation -- Decidability Algorithm for LTL_ACK -- Conclusion, Future Work -- Pure Iteration and Periodicity -- Introduction and Notation -- Background and Motivation -- The Hierarchy IT -- A Note on Presburger Arithmetic and IT -- Discussion and Directions for Further Research -- Programming Experimental Procedures for Newtonian Kinematic Machines -- Introduction -- Experimental Procedures and Languages -- Experimental Procedures and Pseudocode -- A Simple Language EP(T) for Experimental Procedures -- Behaviour of Procedures -- Examples -- Routines -- Restrictions and Extensions of the Language for Experimental Procedures -- Physical Extensions -- Mathematical Extensions -- Experimental Computation with Rational Numbers -- Concluding Remarks -- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time -- Introduction -- Problem Definition -- A Calculus to Certify Polynomial Bounds -- Data Flow Relations -- Certifying Linear Bounds -- Analysing Running Time -- Concluding Remarks -- A Summation Algorithm from 11th Century China -- Shen Gua's Text A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC -- Introduction -- How a Number-Theorist Got Involved with Computers -- The Structure of the ENIAC -- Lehmer's ENIAC `Program' -- The Mathematical Problem -- Description of the Main Steps of the Computation -- Outline of the Set-Up of the Computation on the ENIAC -- Discussion -- Phase Transitions for Weakly Increasing Sequences -- Introduction -- Classifying Phase Transitions for Weakly Increasing Sequences -- The Erdös-Szekeres Theorem and the Dilworth Decomposition Theorem -- Succinct NP Proofs from an Extractability Assumption -- Introduction -- Definitions and Tools -- An Extractability Assumption -- Our EA Assumption -- A Low-Communication 1-Round Argument for NP -- Describing the Wadge Hierarchy for the Alternation Free Fragment of μ-Calculus (I) -- Introduction -- The Propositional Modal \mu-Calculus -- Syntax and Semantics -- The Alternation Free Fragment -- Evaluation Game for the \mu-Calculus -- The Wadge Hierarchy -- Main Result -- Conclusion -- Subrecursive Complexity of Identifying the Ramsey Structure of Posets -- Introduction -- Preliminaries -- Layered Posets -- The First Amalgamation -- The Second Amalgamation -- Solving Simple Stochastic Games -- Introduction -- References -- The Shrinking Property for NP and coNP -- Introduction -- Preliminaries -- Disjoint NP-Pairs -- Function Classes -- Connections to Reasonable Assumptions -- Oracle Separations -- Conclusions and Open Questions -- On the Hardness of Truthful Online Auctions with Multidimensional Constraints -- Introduction and Related Work -- Previous Work -- Our Results -- Model and Definitions -- First Impossibility: With Private Time Parameters -- Second Impossibility: Relaxing Private Time Parameters -- Conclusions -- Effective Dimensions and Relative Frequencies -- Introduction Shen Gua's Algorithm -- Conclusion -- Sequential Automatic Algebras -- General Properties, Separating Examples and Classification Results -- Linear Order Algebras -- Sequential Automatic Unary Algebras -- The Role of Classical Computation in Measurement-Based Quantum Computation -- Introduction -- One-Way Model of Quantum Computation -- CNOT Computers -- Discussion -- The Algebraic Counterpart of the Wagner Hierarchy -- Introduction -- Preliminaries -- \omega-Languages -- \omega-Semigroups -- The Wadge and the Wagner Hierarchies -- The \mathbb{SG}-Hierarchy -- The \mathbb{FSG} and the Wagner Hierarchies -- Conclusion -- Computing by Observing: A Brief Survey -- Introduction -- Computing by Observing -- An Example of Observer: Automata with Singular Output -- G/O Systems -- Always Writing G/O Systems -- Initial G/O Systems -- Free G/O Systems -- Computing by Only Observing -- Restrictions on the Observed System -- Final Remarks -- A Quantum Information-Theoretic Proof of the Relation between Horn's Problem and the Littlewood-Richardson Coefficients -- Introduction and Results -- Preliminaries -- Spectrum Estimation -- Littlewood-Richardson Coefficients -- Proofs -- From Hermitian Operators to Density Operators -- Proof of Theorem 5 -- Proof of Theorem 6 -- Pell Equations and Weak Regularity Principles -- Introduction -- Limit Schemata and Weak Regularity -- Dirichlet's Approximation Lemma in IE_1 -- Bounded WR vs. exp -- Computable Categoricity of Graphs with Finite Components -- Introduction -- Computable Categoricity and the Size Function -- A Sufficient Condition for Not Computably Categorical -- Infinite Chains of Embedded Components -- P Automata: Membrane Systems as Acceptors -- On the Processing Power of Protozoa -- Computing Equilibria in Large Games We Play A Division by General Recursion, Historical Approach |
| Title | Logic and theory of algorithms : 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008 : proceedings |
| URI | https://cir.nii.ac.jp/crid/1130000795619723904 https://ebookcentral.proquest.com/lib/[SITE_ID]/detail.action?docID=3068527 https://www.vlebooks.com/vleweb/product/openreader?id=none&isbn=9783540694076 |
| Volume | 5028 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fb9MwELZKERJ9AQZoBYYsxGOCkjSxHd7aqmiaBk9j2luwExuidglqWpB45g_nzkmddkPix4uVROk59Xe6-3y-swl5DTaRKx6kvgJ35Mdmkvgy1cKXMpwIw4TOpc22-MBOP8ZnV8nVYPBpL2tpu1Fv8h-_rSv5H1ThGeCKVbL_gKwTCg_gGvCFFhCG9gb5dbdd5TIarF3yY7dKLlefa5jpf7lu7DQ_xuIiV86HawLtAQ7tvty22q-NxNtQabnAvQWFtRS4H0LT1a_oLsaOm4uECQwL3uGbto_e-zlm_lddIq3F70MZTtjtfl2MYqbz5XV3mvN0XdWrwvFvrM9ag1X_Wm9XbcbgvAbC677nHDMBZuy7_RszMOxFudwchDrEjVDHLtR5MAXGuBVLgXZGvUdzeYazqWACJ0XgpO9wDlbv7nRxdn7ponBo0lgadUU_Vg675-JhrdwRGclmCS4H3NGmAQ5SleUtz23pyMVDMsQSlUdkoKsj8mB3MAft7PQRGb13m_E2j8lPqy0UtIW22kJrQ3ttoW8pYEF74Ghd0QPgaFnRFjiPgqZQHDSPtnh5tEXLo6gj1OqIZ98AuXv68YRcvltczE_97vANX-Ie_oFvVCFDyWUhJ0rIMA-kVlyxQrI0jE2shTFK5kkAFzwNRY5UGOh0oCWPtAnk5CkZVnWljwkNVJGy3BgZJXmcm1Bx4EtBYIDLSvTGY_Jqb4SzbyubKNBkezBwNiYnMPBZXmIb4ios0Fssy8Zz89IgHhO6gySzv--ym7PFbA4qIJKIP_uDiOfkfq92L8hws97qE-CcG_WyU5xfoQp2kw |
| linkProvider | Library Specific Holdings |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=book&rft.title=Logic+and+theory+of+algorithms+%3A+4th+Conference+on+Computability+in+Europe%2C+CiE+2008%2C+Athens%2C+Greece%2C+June+15-20%2C+2008+%3A+proceedings&rft.au=Conference+on+Computability+in+Europe+%284th+%3A+2008+%3A+Athens%2C+Greece%29&rft.au=Beckmann%2C+Arnold&rft.au=Dimitracopoulos%2C+Costas&rft.au=L%C3%B6we%2C+Benedikt&rft.date=2008-01-01&rft.pub=Springer&rft.isbn=9783540694052&rft.externalDocID=BA86830672 |
| thumbnail_m | http://utb.summon.serialssolutions.com/2.0.0/image/custom?url=https%3A%2F%2Fvle.dmmserver.com%2Fmedia%2F640%2F97835406%2F9783540694076.jpg |