Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Cultures of Mathematics and Logic : Selected Papers from the Conference in Guangzhou, China, November 9-12, 2012 / / edited by Shier Ju, Benedikt Löwe, Thomas Müller, Yun Xie
| Cultures of Mathematics and Logic : Selected Papers from the Conference in Guangzhou, China, November 9-12, 2012 / / edited by Shier Ju, Benedikt Löwe, Thomas Müller, Yun Xie |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2016 |
| Descrizione fisica | 1 online resource (IX, 123 p. 19 illus., 2 illus. in color.) |
| Disciplina | 510.9 |
| Collana | Trends in the History of Science |
| Soggetto topico |
Mathematics
History Mathematical logic Logic History of Mathematical Sciences Mathematical Logic and Foundations |
| ISBN | 3-319-31502-1 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preface -- Brendan Larvor: What are mathematical cultures? -- Benedikt Löwe: Philosophy or not? The study of cultures and practices of mathematics -- Baptiste Mélès: Abacus as a Programming Language: Computer Science and History of Mathematics -- Stig Andur Pedersen: Mathematics in Engineering and Science -- Johannes Wietzke: A Fashionable Curiosity: Claudius Ptolemy's "Desire for Knowledge" in Literary Context -- Jia-Ming Ying: Transmission and interactions among different types of geometrical argumentations: From Jesuits in China to Nam Pyŏng-Gil in Korea. |
| Record Nr. | UNINA-9910254079703321 |
| Cham : , : Springer International Publishing : , : Imprint : Birkhäuser, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
How the World Computes [[electronic resource] ] : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012, Proceedings / / edited by Barry S. Cooper, Anuj Dawar, Benedikt Löwe
| How the World Computes [[electronic resource] ] : Turing Centenary Conference and 8th Conference on Computability in Europe, CiE 2012, Cambridge, UK, June 18-23, 2012, Proceedings / / edited by Barry S. Cooper, Anuj Dawar, Benedikt Löwe |
| Edizione | [1st ed. 2012.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 |
| Descrizione fisica | 1 online resource (XVIII, 756 p. 42 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Mathematical logic Theory of Computation Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Mathematical Logic and Foundations |
| ISBN | 3-642-30870-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465321303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2012 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Infinity in Logic and Computation [[electronic resource] ] : International Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers / / edited by Margaret Archibald, Vasco Brattka, Valentin F. Goranko, Benedikt Löwe
| Infinity in Logic and Computation [[electronic resource] ] : International Conference, ILC 2007, Cape Town, South Africa, November 3-5, 2007, Revised Selected Papers / / edited by Margaret Archibald, Vasco Brattka, Valentin F. Goranko, Benedikt Löwe |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XIII, 139 p.) |
| Disciplina | 004n/a |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Artificial intelligence
Computer programming Programming languages (Electronic computers) Computers Algorithms Mathematical logic Artificial Intelligence Programming Techniques Programming Languages, Compilers, Interpreters Theory of Computation Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages |
| Soggetto genere / forma |
Cape Town (2007)
Kongress. |
| ISBN | 3-642-03092-0 |
| Classificazione |
004
DAT 500f SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Nadia Busi (1968–2007) -- Symbolic Model Checking of Tense Logics on Rational Kripke Models -- Genetic Systems without Inhibition Rules -- Probabilistic Systems with LimSup and LimInf Objectives -- A Playful Glance at Hierarchical Questions for Two-Way Alternating Automata -- Towards Model-Checking Programs with Lists -- Representations of Numbers as :A Saddle Point Approach -- Sets of Infinite Words Recognized by Deterministic One-Turn Pushdown Automata -- Fine-Continuous Functions and Fractals Defined by Infinite Systems of Contractions -- Is P?=?PSPACE for Infinite Time Turing Machines?. |
| Record Nr. | UNISA-996465841803316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic and the Foundations of Game and Decision Theory - LOFT 8 [[electronic resource] ] : 8th International Conference, Amsterdam, The Netherlands, July 3-5, 2008, Revised Selected Papers / / edited by Giacomo Bonanno, Benedikt Löwe, Wiebe van der Hoek
| Logic and the Foundations of Game and Decision Theory - LOFT 8 [[electronic resource] ] : 8th International Conference, Amsterdam, The Netherlands, July 3-5, 2008, Revised Selected Papers / / edited by Giacomo Bonanno, Benedikt Löwe, Wiebe van der Hoek |
| Edizione | [1st ed. 2010.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 |
| Descrizione fisica | 1 online resource (XI, 207 p. 35 illus.) |
| Disciplina | 005.13 |
| Collana | Lecture Notes in Artificial Intelligence |
| Soggetto topico |
Programming languages (Electronic computers)
Computer programming Computers Mathematical logic Computer logic Computer science—Mathematics Programming Languages, Compilers, Interpreters Programming Techniques Theory of Computation Mathematical Logic and Formal Languages Logics and Meanings of Programs Discrete Mathematics in Computer Science |
| ISBN |
1-280-38836-6
9786613566287 3-642-15164-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Infinite Coordination Games -- Conditioning by Minimizing Accessibility -- Correspondences in the Theory of Aggregation -- Logic and Data Exchange: Which Solutions Are “Good” Solutions? -- Preference Change Triggered by Belief Change: A Principled Approach -- A Runs-and-Systems Semantics for Logics of Announcements -- From Nash to Dependency Equilibria -- Bridges between Dynamic Doxastic and Doxastic Temporal Logics -- Multi-agent Belief Revision with Linked Preferences -- A Note on Assumption-Completeness in Modal Logic. |
| Record Nr. | UNISA-996466571603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2010 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logic and Theory of Algorithms [[electronic resource] ] : 4th Conference on Computability in Europe, CiE 2008 Athens, Greece, June 15-20, 2008, Proceedings / / edited by Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe
| Logic and Theory of Algorithms [[electronic resource] ] : 4th Conference on Computability in Europe, CiE 2008 Athens, Greece, June 15-20, 2008, Proceedings / / edited by Arnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 |
| Descrizione fisica | 1 online resource (XIX, 596 p.) |
| Disciplina | 005.1 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Software engineering
Life sciences Computer programming Computer science Algorithms Computer science—Mathematics Software Engineering Life Sciences Programming Techniques Theory of Computation Mathematics of Computing |
| ISBN | 3-540-69407-2 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Deterministic Graphical Games Revisited -- Program Schemes with Deep Pushdown Storage -- Herbrand Theorems and Skolemization for Prenex Fuzzy Logics -- Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL -- Pure Iteration and Periodicity -- Programming Experimental Procedures for Newtonian Kinematic Machines -- Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time -- A Summation Algorithm from 11th Century China -- Sequential Automatic Algebras -- The Role of Classical Computation in Measurement-Based Quantum Computation -- The Algebraic Counterpart of the Wagner Hierarchy -- Computing by Observing: A Brief Survey -- A Quantum Information-Theoretic Proof of the Relation between Horn’s Problem and the Littlewood-Richardson Coefficients -- Pell Equations and Weak Regularity Principles -- Computable Categoricity of Graphs with Finite Components -- P Automata: Membrane Systems as Acceptors -- On the Processing Power of Protozoa -- Computing Equilibria in Large Games We Play -- A Week-End Off: The First Extensive Number-Theoretical Computation on the ENIAC -- Phase Transitions for Weakly Increasing Sequences -- Succinct NP Proofs from an Extractability Assumption -- Describing the Wadge Hierarchy for the Alternation Free Fragment of ?-Calculus (I) -- Subrecursive Complexity of Identifying the Ramsey Structure of Posets -- Solving Simple Stochastic Games -- The Shrinking Property for NP and coNP -- On the Hardness of Truthful Online Auctions with Multidimensional Constraints -- Effective Dimensions and Relative Frequencies -- Reachability in Linear Dynamical Systems -- Hybrid Functional Interpretations -- The Algorithm Concept – Tool for Historiographic Interpretation or Red Herring? -- Adversarial Scheduling Analysis of Game-Theoretic Models of Norm Diffusion -- A Simple P-Matrix Linear Complementarity Problem for Discounted Games -- Implementing Spi Calculus Using Nominal Techniques -- An Enhanced Theory of Infinite Time Register Machines -- Many Facets of Complexity in Logic -- On the Computational Power of Enhanced Mobile Membranes -- Recursion in Higher Types and Resource Bounded Turing Machines -- Computability and Complexity in Self-assembly -- Extraction in Coq: An Overview -- Joining to High Degrees -- Factoring Out Intuitionistic Theorems: Continuity Principles and the Uniform Continuity Theorem -- Interpreting Localized Computational Effects Using Operators of Higher Type -- Uniform Algebraic Reducibilities between Parameterized Numeric Graph Invariants -- Updatable Timed Automata with Additive and Diagonal Constraints -- First-Order Model Checking Problems Parameterized by the Model -- Domain Theory and the Causal Structure of Space-Time -- Recursion on Nested Datatypes in Dependent Type Theory -- Perfect Local Computability and Computable Simulations -- Complete Determinacy and Subsystems of Second Order Arithmetic -- Internal Density Theorems for Hierarchies of Continuous Functionals -- Two-by-Two Substitution Systems and the Undecidability of the Domino Problem -- The Relative Consistency of the Axiom of Choice — Mechanized Using Isabelle/ZF -- Upper Semilattices in Many-One Degrees -- Union of Reducibility Candidates for Orthogonal Constructor Rewriting -- The Quantum Complexity of Markov Chain Monte Carlo -- Topological Dynamics of 2D Cellular Automata -- Complexity of Aperiodicity for Topological Properties of Regular ?-Languages -- ?-Degree Spectra -- Cupping Classes of Enumeration Degrees -- Principal Typings for Explicit Substitutions Calculi -- How We Think of Computing Today. |
| Record Nr. | UNISA-996465311403316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Logical Approaches to Computational Barriers [[electronic resource] ] : Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings / / edited by Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker
| Logical Approaches to Computational Barriers [[electronic resource] ] : Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings / / edited by Arnold Beckmann, Ulrich Berger, Benedikt Löwe, John V. Tucker |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XV, 608 p.) |
| Disciplina | 511.3/52 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Artificial intelligence Bioinformatics Theory of Computation Mathematics of Computing Artificial Intelligence |
| ISBN | 3-540-35468-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Heap-Abstraction for an Object-Oriented Calculus with Thread Classes -- From Constructibility and Absoluteness to Computability and Domain Independence -- Datatype-Generic Reasoning -- The Logical Strength of the Uniform Continuity Theorem -- Elementary Algebraic Specifications of the Rational Function Field -- Random Closed Sets -- Deep Inference and Its Normal Form of Derivations -- Logspace Complexity of Functions and Structures -- Prefix-Like Complexities and Computability in the Limit -- Partial Continuous Functions and Admissible Domain Representations -- An Invariant Cost Model for the Lambda Calculus -- On the Complexity of the Sperner Lemma -- The Church-Turing Thesis: Consensus and Opposition -- Gödel and the Origins of Computer Science -- The Role of Algebraic Models and Type-2 Theory of Effectivity in Special Purpose Processor Design -- Turing Universality in Dynamical Systems -- Every Sequence Is Decompressible from a Random One -- Reversible Conservative Rational Abstract Geometrical Computation Is Turing-Universal -- LJQ: A Strongly Focused Calculus for Intuitionistic Logic -- Böhm Trees, Krivine’s Machine and the Taylor Expansion of Lambda-Terms -- What Does the Incompleteness Theorem Add to the Unsolvability of the Halting Problem? -- An Analysis of the Lemmas of Urysohn and Urysohn-Tietze According to Effective Borel Measurability -- Enumeration Reducibility with Polynomial Time Bounds -- Coinductive Proofs for Basic Real Computation -- A Measure of Space for Computing over the Reals -- On Graph Isomorphism for Restricted Graph Classes -- Infinite Time Register Machines -- Upper and Lower Bounds on Sizes of Finite Bisimulations of Pfaffian Hybrid Systems -- Forcing with Random Variables and Proof Complexity -- Complexity-Theoretic Hierarchies -- Undecidability in the Homomorphic Quasiorder of Finite Labeled Forests -- Lower Bounds Using Kolmogorov Complexity -- The Jump Classes of Minimal Covers -- Space Bounds for Infinitary Computation -- From a Zoo to a Zoology: Descriptive Complexity for Graph Polynomials -- Towards a Trichotomy for Quantified H-Coloring -- Two Open Problems on Effective Dimension -- Optimization and Approximation Problems Related to Polynomial System Solving -- Uncomputability Below the Real Halting Problem -- Constraints on Hypercomputation -- Martingale Families and Dimension in P -- Can General Relativistic Computers Break the Turing Barrier? -- Degrees of Weakly Computable Reals -- Understanding and Using Spector’s Bar Recursive Interpretation of Classical Analysis -- A Subrecursive Refinement of the Fundamental Theorem of Algebra -- An Introduction to Program and Thread Algebra -- Fast Quantifier Elimination Means P = NP -- Admissible Representations in Computable Analysis -- Do Noetherian Modules Have Noetherian Basis Functions? -- Inverting Monotone Continuous Functions in Constructive Analysis -- Partial Recursive Functions in Martin-Löf Type Theory -- Partially Ordered Connectives and ?1 1 on Finite Models -- Upper and Lower Bounds for the Computational Power of P Systems with Mobile Membranes -- Gödel’s Conflicting Approaches to Effective Calculability -- Co-total Enumeration Degrees -- Relativized Degree Spectra -- Phase Transition Thresholds for Some Natural Subclasses of the Computable Functions -- Non-deterministic Halting Times for Hamkins-Kidder Turing Machines -- Kurt Gödel and Computability Theory -- A Computability Theory of Real Numbers -- Primitive Recursive Selection Functions over Abstract Algebras. |
| Record Nr. | UNISA-996465744603316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Models of Computation in Context [[electronic resource] ] : 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011, Proceedings / / edited by Benedikt Löwe, Dag Normann, Ivan Soskov, Alexandra Soskova
| Models of Computation in Context [[electronic resource] ] : 7th Conference on Computability in Europe, CiE 2011, Sofia, Bulgaria, June 27 - July 2, 2011, Proceedings / / edited by Benedikt Löwe, Dag Normann, Ivan Soskov, Alexandra Soskova |
| Edizione | [1st ed. 2011.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 |
| Descrizione fisica | 1 online resource (XIII, 319 p. 27 illus., 11 illus. in color.) |
| Disciplina | 511.3/52 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Mathematical logic Theory of Computation Discrete Mathematics in Computer Science Symbolic and Algebraic Manipulation Mathematical Logic and Foundations |
| ISBN | 3-642-21875-X |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465925703316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2011 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The Nature of Computation: Logic, Algorithms, Applications [[electronic resource] ] : 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013, Proceedings / / edited by Paola Bonizzoni, Vasco Brattka, Benedikt Löwe
| The Nature of Computation: Logic, Algorithms, Applications [[electronic resource] ] : 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013, Proceedings / / edited by Paola Bonizzoni, Vasco Brattka, Benedikt Löwe |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 446 p. 42 illus.) : digital |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Mathematical logic Theory of Computation Discrete Mathematics in Computer Science Mathematical Applications in Computer Science Computer Science Logic and Foundations of Programming Mathematical Logic and Foundations |
| ISBN | 3-642-39053-6 |
| Classificazione |
DAT 517f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996465373503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
The Nature of Computation: Logic, Algorithms, Applications : 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013, Proceedings / / edited by Paola Bonizzoni, Vasco Brattka, Benedikt Löwe
| The Nature of Computation: Logic, Algorithms, Applications : 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013, Proceedings / / edited by Paola Bonizzoni, Vasco Brattka, Benedikt Löwe |
| Edizione | [1st ed. 2013.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 |
| Descrizione fisica | 1 online resource (XVIII, 446 p. 42 illus.) : digital |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Discrete mathematics Mathematical logic Theory of Computation Discrete Mathematics in Computer Science Mathematical Applications in Computer Science Computer Science Logic and Foundations of Programming Mathematical Logic and Foundations |
| ISBN | 3-642-39053-6 |
| Classificazione |
DAT 517f
SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNINA-9910484704303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2013 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
New Computational Paradigms [[electronic resource] ] : First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe
| New Computational Paradigms [[electronic resource] ] : First Conference on Computability in Europe, CiE 2005, Amsterdam, The Netherlands, June 8-12, 2005, Proceedings / / edited by Barry S. Cooper, Benedikt Löwe |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
| Descrizione fisica | 1 online resource (XVIII, 578 p.) |
| Disciplina | 511.3/52 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Artificial intelligence Bioinformatics Theory of Computation Mathematics of Computing Artificial Intelligence |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction: If CiE Did Not Exist, It Would Be Necessary to Invent It -- Computably Enumerable Sets in the Solovay and the Strong Weak Truth Table Degrees -- The Fan Theorem and Uniform Continuity -- Continuous Semantics for Strong Normalization -- A Thread Algebra with Multi-level Strategic Interleaving -- Membrane Computing — Current Results and Future Problems -- How to Compare the Power of Computational Models -- Recombinant DNA ,Gene Splicing as Generative Devices of Formal Languages -- Quantum Computing -- Symbol Grounding in Connectionist and Adaptive Agent Models -- The Complexity of Inductive Definability -- A Logical Approach to Abstract Algebra -- Schnorr Dimension -- Abstract Geometrical Computation: Turing-Computing Ability and Undecidability -- Computability in Computational Geometry -- Shrad: A Language for Sequential Real Number Computation -- Borel Ranks and Wadge Degrees of Context Free ?-Languages -- Fewer Epistemological Challenges for Connectionism -- An Algebraic View on Exact Learning from Queries -- The Church-Turing Thesis: Breaking the Myth -- Robust Simulations of Turing Machines with Analytic Maps and Flows -- Infinitary Computability with Infinite Time Turing Machines -- Combinatorial Models of Gene Assembly -- Symmetric Enumeration Reducibility -- Computability-Theoretic and Proof-Theoretic Aspects of Vaughtian Model Theory -- Finite Trees as Ordinals -- On the Problems of Definability in the Enumeration Degrees -- Computing a Model of Set Theory -- Proof Mining in Functional Analysis -- Towards Computability of Higher Type Continuous Data -- The Power of Mobility: Four Membranes Suffice -- The Small Grzegorczyk Classes and the Typed ?-Calculus -- The Flow of Data and the Complexity of Algorithms -- On a Question of Sacks — A Partial Solution on the Positive Side -- The Low Splitting Theorem in the Difference Hierarchy -- Geometric Software: Robustness Issues and Model of Computation -- The Dimension of a Point: Computability Meets Fractal Geometry -- Accepting Networks of Splicing Processors -- Hilbert’s Tenth Problem and Paradigms of Computation -- On Some Relations Between Approximation Problems and PCPs over the Real Numbers -- Correlation Dimension and the Quality of Forecasts Given by a Neural Network -- The Computational Complexity of One-Dimensional Sandpiles -- Categoricity in Restricted Classes -- Recursion and Complexity -- FM-Representability and Beyond -- Formalising Exact Arithmetic in Type Theory -- Complexity in Predicative Arithmetic -- Domain-Theoretic Formulation of Linear Boundary Value Problems -- Membrane Computing: Power, Efficiency, Applications -- The Analogue of Büchi’s Problem for Polynomials -- On the Turing Degrees of Divergence Bounded Computable Reals -- New Algorithmic Paradigms in Exponential Time Algorithms -- Some Reducibilities on Regular Sets -- Computability and Discrete Dynamical Systems -- Uniform Operators -- Minimal Pairs and Quasi-minimal Degrees for the Joint Spectra of Structures -- Presentations of K-Trivial Reals and Kolmogorov Complexity -- Presentations of Structures in Admissible Sets -- An Environment Aware P-System Model of Quorum Sensing -- Kripke Models, Distributive Lattices, and Medvedev Degrees -- Arthur-Merlin Games and the Problem of Isomorphism Testing -- Beyond the Super-Turing Snare: Analog Computation and Digital Virtuality -- A Network Model of Analogue Computation over Metric Algebras -- Computable Analysis -- The Transfinite Action of 1 Tape Turing Machines -- Complexity of Continuous Space Machine Operations -- Computable Analysis of a Non-homogeneous Boundary-Value Problem for the Korteweg-de Vries Equation -- Computability and Continuity on the Real Arithmetic Hierarchy and the Power of Type-2 Nondeterminism. |
| Record Nr. | UNISA-996466072303316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
