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.
Evolving Computability [[electronic resource] ] : 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings / / edited by Arnold Beckmann, Victor Mitrana, Mariya Soskova
| Evolving Computability [[electronic resource] ] : 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings / / edited by Arnold Beckmann, Victor Mitrana, Mariya Soskova |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XV, 363 p. 20 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Machine theory Bioinformatics Theory of Computation Mathematics of Computing Formal Languages and Automata Theory Computational and Systems Biology |
| ISBN | 3-319-20028-3 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computers and the Mechanics of Communication. Outline of a Vision from the Work of Petri and Holt -- Error and predicativity -- Is Human Mind Fully Algorithmic? Remarks on Kurt Godel's Incompleteness Theorems -- A New Approach to the Paperfolding Sequences -- Covering the Recursive Sets -- On Distributed Monitoring and Synthesis -- Newton's Forward Difference Equation for Functions from Words to Words -- Degrees of unsolvability: a tutorial -- Universality in Molecular and Cellular Computing -- Some results on interactive proofs for real computations -- Prime Model with No Degree of Autostability Relative to Strong Constructivizations -- Immune Systems in Computer Virology -- ITRM-Recognizability from Random Oracles -- Systems with Parallel Rewriting for Chain Code Picture Languages -- Base-Complexity Classifications of QCB0-Spaces (Extended Abstract) -- Maximal Vector Spaces form an Automorphism Basis -- New Bounds on Optimal Sorting Networks -- Nonexistence of Minimal Pairs in L[d] -- Intuitionistic Provability versus Uniform Provability in RCA -- Randomness and Differentiability of Convex Functions -- Weighted automata on infinite words in the context of Attacker-Defender games -- Turing jumps through provability -- Rice's Theorem in Effectively Enumerable Topological Spaces -- Decidability of Termination Problems for Sequential P Systems with Active Membranes -- Weihrauch degrees of finding equilibria in sequential games -- Prefix and Right-Partial Derivative Automata -- A Note on the Computable Categoricity of l^p Spaces -- n the Computational Content of Termination Proofs -- Local compactness for computable Polish metric spaces is $\Pi^1_1$-complete -- Iterative forcing and hyperimmunity in reverse mathematics -- Completely regular Bishop spaces -- Computing Equality-Free String Factorisations -- Towards the Effective Descriptive Set Theory -- On Computability of Navier-Stokes' Equation -- Undecidability as a Consequence of Incompleteness -- How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems. |
| Record Nr. | UNISA-996198520003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Evolving Computability : 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings / / edited by Arnold Beckmann, Victor Mitrana, Mariya Soskova
| Evolving Computability : 11th Conference on Computability in Europe, CiE 2015, Bucharest, Romania, June 29-July 3, 2015. Proceedings / / edited by Arnold Beckmann, Victor Mitrana, Mariya Soskova |
| Edizione | [1st ed. 2015.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 |
| Descrizione fisica | 1 online resource (XV, 363 p. 20 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Machine theory Bioinformatics Theory of Computation Mathematics of Computing Formal Languages and Automata Theory Computational and Systems Biology |
| ISBN | 3-319-20028-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computers and the Mechanics of Communication. Outline of a Vision from the Work of Petri and Holt -- Error and predicativity -- Is Human Mind Fully Algorithmic? Remarks on Kurt Godel's Incompleteness Theorems -- A New Approach to the Paperfolding Sequences -- Covering the Recursive Sets -- On Distributed Monitoring and Synthesis -- Newton's Forward Difference Equation for Functions from Words to Words -- Degrees of unsolvability: a tutorial -- Universality in Molecular and Cellular Computing -- Some results on interactive proofs for real computations -- Prime Model with No Degree of Autostability Relative to Strong Constructivizations -- Immune Systems in Computer Virology -- ITRM-Recognizability from Random Oracles -- Systems with Parallel Rewriting for Chain Code Picture Languages -- Base-Complexity Classifications of QCB0-Spaces (Extended Abstract) -- Maximal Vector Spaces form an Automorphism Basis -- New Bounds on Optimal Sorting Networks -- Nonexistence of Minimal Pairs in L[d] -- Intuitionistic Provability versus Uniform Provability in RCA -- Randomness and Differentiability of Convex Functions -- Weighted automata on infinite words in the context of Attacker-Defender games -- Turing jumps through provability -- Rice's Theorem in Effectively Enumerable Topological Spaces -- Decidability of Termination Problems for Sequential P Systems with Active Membranes -- Weihrauch degrees of finding equilibria in sequential games -- Prefix and Right-Partial Derivative Automata -- A Note on the Computable Categoricity of l^p Spaces -- n the Computational Content of Termination Proofs -- Local compactness for computable Polish metric spaces is $\Pi^1_1$-complete -- Iterative forcing and hyperimmunity in reverse mathematics -- Completely regular Bishop spaces -- Computing Equality-Free String Factorisations -- Towards the Effective Descriptive Set Theory -- On Computability of Navier-Stokes' Equation -- Undecidability as a Consequence of Incompleteness -- How to compare Buchholz-style ordinal notation systems with Gordeev-style notation systems. |
| Record Nr. | UNINA-9910484334903321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2015 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Language, Life, Limits [[electronic resource] ] : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014, Proceedings / / edited by Arnold Beckmann, Ersébet Csuhaj-Varjú, Klaus Meer
| Language, Life, Limits [[electronic resource] ] : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014, Proceedings / / edited by Arnold Beckmann, Ersébet Csuhaj-Varjú, Klaus Meer |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 410 p. 33 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Theory of Computation Mathematics of Computing |
| ISBN | 3-319-08019-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | How can Grammatical Inference Contribute to Computational Linguistics? -- Algorithms and Their Explanations -- Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability -- Uniform Schemata for Proof Rules -- Graph Polynomials Motivated by Gene Rearrangements in Ciliates -- On the Equivalence of Automata for KAT-expressions -- Algorithmic Randomness for Infinite Time Register Machines -- Constraint Logic Programming for Resolution of Relative Time Expressions -- Maximal Parallelism in Membrane Systems with Generated Membrane Boundaries -- Learnability Thesis Does Not Entail Church’s Thesis -- Phase Transitions Related to the Pigeonhole Principle -- Generic Parallel Algorithms -- Fit-Preserving Data Refinement of Mass-Action Reaction Networks -- On Maximal Block Functions of Computable η-like Linear Orderings -- Lossiness of Communication Channels Modeled by Transducers -- Predicate Characterizations in the Polynomial-Size Hierarchy -- Function Spaces for Second-Order Polynomial Time -- Complexity of Operation Problems. |
| Record Nr. | UNISA-996199994603316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Language, Life, Limits : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014, Proceedings / / edited by Arnold Beckmann, Ersébet Csuhaj-Varjú, Klaus Meer
| Language, Life, Limits : 10th Conference on Computability in Europe, CiE 2014, Budapest, Hungary, June 23-27, 2014, Proceedings / / edited by Arnold Beckmann, Ersébet Csuhaj-Varjú, Klaus Meer |
| Edizione | [1st ed. 2014.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 |
| Descrizione fisica | 1 online resource (XIV, 410 p. 33 illus.) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science - Mathematics Theory of Computation Mathematics of Computing |
| ISBN | 3-319-08019-9 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | How can Grammatical Inference Contribute to Computational Linguistics? -- Algorithms and Their Explanations -- Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability -- Uniform Schemata for Proof Rules -- Graph Polynomials Motivated by Gene Rearrangements in Ciliates -- On the Equivalence of Automata for KAT-expressions -- Algorithmic Randomness for Infinite Time Register Machines -- Constraint Logic Programming for Resolution of Relative Time Expressions -- Maximal Parallelism in Membrane Systems with Generated Membrane Boundaries -- Learnability Thesis Does Not Entail Church’s Thesis -- Phase Transitions Related to the Pigeonhole Principle -- Generic Parallel Algorithms -- Fit-Preserving Data Refinement of Mass-Action Reaction Networks -- On Maximal Block Functions of Computable η-like Linear Orderings -- Lossiness of Communication Channels Modeled by Transducers -- Predicate Characterizations in the Polynomial-Size Hierarchy -- Function Spaces for Second-Order Polynomial Time -- Complexity of Operation Problems. |
| Record Nr. | UNINA-9910483142603321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2014 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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 | ||
| ||
Logic and theory of algorithms : 4th conference on computability in Europe, CIE 2008, Athens, Greece, June 15-20, 2008 : proceedings / / Arnold Beckmann, Costas Dimitracopoulos, Benedikt Lowe (eds.)
| Logic and theory of algorithms : 4th conference on computability in Europe, CIE 2008, Athens, Greece, June 15-20, 2008 : proceedings / / Arnold Beckmann, Costas Dimitracopoulos, Benedikt Lowe (eds.) |
| Edizione | [1st ed. 2008.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2008 |
| Descrizione fisica | 1 online resource (XIX, 596 p.) |
| Disciplina | 005.1 |
| Altri autori (Persone) |
BeckmannArnold
DimitracopoulosCostas LoweBenedikt |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico |
Computable functions
Computational intelligence |
| 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. |
| Altri titoli varianti | CIE 2008 |
| Record Nr. | UNINA-9910483705003321 |
| Berlin, : Springer, 2008 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
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 | ||
| ||
Logical approaches to computational barriers : Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006 : proceedings / / Arnold Beckmann ... [et al.] (eds.)
| Logical approaches to computational barriers : Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006 : proceedings / / Arnold Beckmann ... [et al.] (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, : Springer, 2006 |
| Descrizione fisica | 1 online resource (XV, 608 p.) |
| Disciplina | 511.3/52 |
| Altri autori (Persone) | BeckmannArnold |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 1, Theoretical computer science and general issues |
| Soggetto topico | Computable functions |
| 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. |
| Altri titoli varianti |
Conference on Computability in Europe
CiE 2006 |
| Record Nr. | UNINA-9910484787403321 |
| Berlin, : Springer, 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Pursuit of the Universal [[electronic resource] ] : 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings / / edited by Arnold Beckmann, Laurent Bienvenu, Nataša Jonoska
| Pursuit of the Universal [[electronic resource] ] : 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings / / edited by Arnold Beckmann, Laurent Bienvenu, Nataša Jonoska |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVI, 375 p. 21 illus.) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Machine theory Bioinformatics Theory of Computation Mathematics of Computing Formal Languages and Automata Theory Computational and Systems Biology |
| ISBN | 3-319-40189-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computable and constructive analysis -- Computation in biological systems -- Cryptography and information theory -- History and philosophy of computing -- Symbolic dynamics -- Weak arithmetic. |
| Record Nr. | UNISA-996465678003316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Pursuit of the Universal : 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings / / edited by Arnold Beckmann, Laurent Bienvenu, Nataša Jonoska
| Pursuit of the Universal : 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings / / edited by Arnold Beckmann, Laurent Bienvenu, Nataša Jonoska |
| Edizione | [1st ed. 2016.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 |
| Descrizione fisica | 1 online resource (XVI, 375 p. 21 illus.) |
| Disciplina | 511.352 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science
Algorithms Computer science—Mathematics Machine theory Bioinformatics Theory of Computation Mathematics of Computing Formal Languages and Automata Theory Computational and Systems Biology |
| ISBN | 3-319-40189-0 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Computable and constructive analysis -- Computation in biological systems -- Cryptography and information theory -- History and philosophy of computing -- Symbolic dynamics -- Weak arithmetic. |
| Record Nr. | UNINA-9910484131103321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2016 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||