Información del autor
Autor Manea, Florin |
Documentos disponibles escritos por este autor (5)
Crear una solicitud de compra Refinar búsquedaBeyond the Horizon of Computability / Anselmo, Marcella ; Della Vedova, Gianluca ; Manea, Florin ; Pauly, Arno
TÃtulo : Beyond the Horizon of Computability : 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings / Tipo de documento: documento electrónico Autores: Anselmo, Marcella, ; Della Vedova, Gianluca, ; Manea, Florin, ; Pauly, Arno, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2020 Número de páginas: XXXVII, 379 p. 21 ilustraciones ISBN/ISSN/DL: 978-3-030-51466-2 Nota general: Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés (eng) Palabras clave: Ciencias de la Computación TeorÃa de las máquinas Algoritmos Informática Red de computadoras Inteligencia artificial TeorÃa de la Computación Lenguajes formales y teorÃa de los autómatas Matemáticas de la Computación Redes de comunicación informática Clasificación: 40.151 Resumen: Este libro constituye las actas de la 16.ª Conferencia sobre Computabilidad en Europa, CiE 2020, que estaba prevista para celebrarse en Fisciano, Italia, del 29 de junio al 3 de julio de 2020. La conferencia pasó a un formato virtual debido a la pandemia de coronavirus. Los 30 artÃculos completos y 5 breves presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 72 presentaciones. CiE promueve el desarrollo de ciencias relacionadas con la computabilidad, que abarcan las matemáticas, la informática y aplicaciones en diversas ciencias naturales y de ingenierÃa, como la fÃsica y la biologÃa, asà como campos relacionados, como la filosofÃa y la historia de la informática. CiE 2020 tuvo como lema Más allá del horizonte de la computabilidad, lo que refleja el interés de CiE en la investigación que transgrede los lÃmites tradicionales de la teorÃa de la computabilidad. Nota de contenido: A Note on Computable Embeddings for Ordinals and Their Reverses -- Clockability for Ordinal Turing Machines -- Some notes on spaces of ideals and computable topology -- Parallelizations in Weihrauch reducibility and constructive reverse mathematics -- Liouville Numbers and the Computational Complexity of Changing Bases -- On Interpretability between some weak essential undecidable theories -- On the Complexity of Conversion between Classic Real Number Representations -- Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power -- Computable analysis and classification problems -- Non-coding enumeration operators -- On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings -- An interactive proof system for Program extraction -- ASNP: a tame fragment of existential second-order logic -- Ackermannian Goodstein sequences of intermediate growth -- On the complexity of validity degrees in Åukasiewicz logic -- Degrees of non-computability of homeomorphism types of Polish spaces -- Time-aware uniformization of winning strategies -- Quantitative Representation Theory of Compact Metric Spaces -- Functions of Baire class one over a Bishop topology -- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from saind sequences -- The Computational Significance of Hausdorff's Maximal Chain Principle -- Prefix of trace languages: clique polynomials and dependency graphs -- Repetitions in Toeplitz words and the Thue threshold -- Simulation of automata networks -- Theoretical and Implementation Aspects of the Formal Language Server (LaSer) -- Balancing Straight-Line Programs for Strings and Trees -- Two-dimensional codes -- Formal Languages in Graph Databases and Information Extraction -- On the perceptron's compression -- #P-completeness of counting update digraphs, cacti, and series-parallel decomposition method -- Faster Online Computation of the Succinct Longest Previous Factor Array -- Recent advances in text-to-pattern distance algorithms -- Insertion-Deletion Systems With Substitutions: The Context-free Case. Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 16th Conference on Computability in Europe, CiE 2020, which was planned to be held in Fisciano, Italy, during June 29 until July 3, 2020. The conference moved to a virtual format due to the coronavirus pandemic. The 30 full and 5 short papers presented in this volume were carefully reviewed and selected from 72 submissions. CiE promotes the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences, such as physics and biology, as well as related fields, such as philosophy and history of computing. CiE 2020 had as its motto Beyond the Horizon of Computability, reflecting the interest of CiE in research transgressing the traditional boundaries of computability theory. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Beyond the Horizon of Computability : 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29–July 3, 2020, Proceedings / [documento electrónico] / Anselmo, Marcella, ; Della Vedova, Gianluca, ; Manea, Florin, ; Pauly, Arno, . - 1 ed. . - [s.l.] : Springer, 2020 . - XXXVII, 379 p. 21 ilustraciones.
ISBN : 978-3-030-51466-2
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
Idioma : Inglés (eng)
Palabras clave: Ciencias de la Computación TeorÃa de las máquinas Algoritmos Informática Red de computadoras Inteligencia artificial TeorÃa de la Computación Lenguajes formales y teorÃa de los autómatas Matemáticas de la Computación Redes de comunicación informática Clasificación: 40.151 Resumen: Este libro constituye las actas de la 16.ª Conferencia sobre Computabilidad en Europa, CiE 2020, que estaba prevista para celebrarse en Fisciano, Italia, del 29 de junio al 3 de julio de 2020. La conferencia pasó a un formato virtual debido a la pandemia de coronavirus. Los 30 artÃculos completos y 5 breves presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 72 presentaciones. CiE promueve el desarrollo de ciencias relacionadas con la computabilidad, que abarcan las matemáticas, la informática y aplicaciones en diversas ciencias naturales y de ingenierÃa, como la fÃsica y la biologÃa, asà como campos relacionados, como la filosofÃa y la historia de la informática. CiE 2020 tuvo como lema Más allá del horizonte de la computabilidad, lo que refleja el interés de CiE en la investigación que transgrede los lÃmites tradicionales de la teorÃa de la computabilidad. Nota de contenido: A Note on Computable Embeddings for Ordinals and Their Reverses -- Clockability for Ordinal Turing Machines -- Some notes on spaces of ideals and computable topology -- Parallelizations in Weihrauch reducibility and constructive reverse mathematics -- Liouville Numbers and the Computational Complexity of Changing Bases -- On Interpretability between some weak essential undecidable theories -- On the Complexity of Conversion between Classic Real Number Representations -- Deterministic and Nondeterministic Iterated Uniform Finite-State Transducers: Computational and Descriptional Power -- Computable analysis and classification problems -- Non-coding enumeration operators -- On the Interplay Between Inductive Inference of Recursive Functions, Complexity Theory and Recursive Numberings -- An interactive proof system for Program extraction -- ASNP: a tame fragment of existential second-order logic -- Ackermannian Goodstein sequences of intermediate growth -- On the complexity of validity degrees in Åukasiewicz logic -- Degrees of non-computability of homeomorphism types of Polish spaces -- Time-aware uniformization of winning strategies -- Quantitative Representation Theory of Compact Metric Spaces -- Functions of Baire class one over a Bishop topology -- Combinatorial properties of degree sequences of 3-uniform hypergraphs arising from saind sequences -- The Computational Significance of Hausdorff's Maximal Chain Principle -- Prefix of trace languages: clique polynomials and dependency graphs -- Repetitions in Toeplitz words and the Thue threshold -- Simulation of automata networks -- Theoretical and Implementation Aspects of the Formal Language Server (LaSer) -- Balancing Straight-Line Programs for Strings and Trees -- Two-dimensional codes -- Formal Languages in Graph Databases and Information Extraction -- On the perceptron's compression -- #P-completeness of counting update digraphs, cacti, and series-parallel decomposition method -- Faster Online Computation of the Succinct Longest Previous Factor Array -- Recent advances in text-to-pattern distance algorithms -- Insertion-Deletion Systems With Substitutions: The Context-free Case. Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 16th Conference on Computability in Europe, CiE 2020, which was planned to be held in Fisciano, Italy, during June 29 until July 3, 2020. The conference moved to a virtual format due to the coronavirus pandemic. The 30 full and 5 short papers presented in this volume were carefully reviewed and selected from 72 submissions. CiE promotes the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences, such as physics and biology, as well as related fields, such as philosophy and history of computing. CiE 2020 had as its motto Beyond the Horizon of Computability, reflecting the interest of CiE in research transgressing the traditional boundaries of computability theory. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
TÃtulo : Computing with Foresight and Industry : 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, Proceedings / Tipo de documento: documento electrónico Autores: Manea, Florin, ; Martin, Barnaby, ; Paulusma, Daniël, ; Primiero, Giuseppe, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2019 Número de páginas: XII, 323 p. 479 ilustraciones, 12 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-22996-2 Nota general: Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés (eng) Palabras clave: Algoritmos Ciencias de la Computación TeorÃa de las máquinas Inteligencia artificial Informática Matemáticas discretas Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Ciencia de los datos Matemáticas discretas en informática Clasificación: 518.1 Resumen: Este libro constituye las actas arbitradas de la 15.ª Conferencia sobre Computabilidad en Europa, CiE 2019, celebrada en Durham, Reino Unido, en julio de 2019. Los 20 artÃculos completos revisados ​​presentados fueron cuidadosamente revisados ​​y seleccionados entre 35 presentaciones. Además, este volumen incluye 7 ponencias invitadas. La conferencia CiE 2018 contó con las siguientes seis sesiones especiales: neurociencia computacional, historia y filosofÃa de la computación, nociones básicas en computabilidad, programación probabilÃstica y computación de orden superior, análisis probabilÃstico y suavizado de algoritmos y computación transnita. Tipo de medio : Computadora Summary : This book constitutes the refereed proceedings of the 15th Conference on Computability in Europe, CiE 2019, held in Durham, UK, in July 2019. The 20 revised full papers presented were carefully reviewed and selected from 35 submissions. In addition, this volume includes 7 invited papers. The conference CiE 2018 had the following six special sessions: computational neuroscience, history and philosophy of computing, lowness notions in computability, probabilistic programming and higher-order computation, smoothed and probabilistic analysis of algorithms, and transnite computations. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Computing with Foresight and Industry : 15th Conference on Computability in Europe, CiE 2019, Durham, UK, July 15–19, 2019, Proceedings / [documento electrónico] / Manea, Florin, ; Martin, Barnaby, ; Paulusma, Daniël, ; Primiero, Giuseppe, . - 1 ed. . - [s.l.] : Springer, 2019 . - XII, 323 p. 479 ilustraciones, 12 ilustraciones en color.
ISBN : 978-3-030-22996-2
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
Idioma : Inglés (eng)
Palabras clave: Algoritmos Ciencias de la Computación TeorÃa de las máquinas Inteligencia artificial Informática Matemáticas discretas Lógica informática y fundamentos de la programación. Lenguajes formales y teorÃa de los autómatas Ciencia de los datos Matemáticas discretas en informática Clasificación: 518.1 Resumen: Este libro constituye las actas arbitradas de la 15.ª Conferencia sobre Computabilidad en Europa, CiE 2019, celebrada en Durham, Reino Unido, en julio de 2019. Los 20 artÃculos completos revisados ​​presentados fueron cuidadosamente revisados ​​y seleccionados entre 35 presentaciones. Además, este volumen incluye 7 ponencias invitadas. La conferencia CiE 2018 contó con las siguientes seis sesiones especiales: neurociencia computacional, historia y filosofÃa de la computación, nociones básicas en computabilidad, programación probabilÃstica y computación de orden superior, análisis probabilÃstico y suavizado de algoritmos y computación transnita. Tipo de medio : Computadora Summary : This book constitutes the refereed proceedings of the 15th Conference on Computability in Europe, CiE 2019, held in Durham, UK, in July 2019. The 20 revised full papers presented were carefully reviewed and selected from 35 submissions. In addition, this volume includes 7 invited papers. The conference CiE 2018 had the following six special sessions: computational neuroscience, history and philosophy of computing, lowness notions in computability, probabilistic programming and higher-order computation, smoothed and probabilistic analysis of algorithms, and transnite computations. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
TÃtulo : Connecting with Computability : 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings / Tipo de documento: documento electrónico Autores: De Mol, Liesbeth, ; Weiermann, Andreas, ; Manea, Florin, ; Fernández-Duque, David, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2021 Número de páginas: XXIV, 506 p. 30 ilustraciones, 16 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-80049-9 Nota general: Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés (eng) Palabras clave: Algoritmos Ciencias de la Computación Informática Inteligencia artificial Estructuras de datos (Informática) TeorÃa de la información TeorÃa de la Computación Matemáticas de la Computación Estructuras de datos y teorÃa de la información Lógica informática y fundamentos de la programación. Clasificación: 518.1 Resumen: Este libro constituye las actas de la 17.ª Conferencia sobre Computabilidad en Europa, CiE 2021, organizada por la Universidad de Gante en julio de 2021. Debido a la pandemia de COVID-19, la conferencia se celebró de forma virtual. Los 48 artÃculos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 50 presentaciones. CiE promueve el desarrollo de ciencias relacionadas con la computabilidad, que abarcan las matemáticas, la informática y aplicaciones en diversas ciencias naturales y de ingenierÃa, como la fÃsica y la biologÃa, asà como campos relacionados, como la filosofÃa y la historia de la informática. CiE 2021 tuvo como lema Conectar con Computabilidad, un claro reconocimiento de la naturaleza conectora e interdisciplinaria de la serie de conferencias, que es aún más importante en una época en la que las personas están más desconectadas que nunca unas de otras debido a la pandemia de COVID-19. Nota de contenido: Searching for Applicable Versions of Computable Structures -- On Measure Quantifiers in First-Order Arithmetic -- Pistone Learning Languages with Decidable Hypotheses -- Robust Online Algorithms for Dynamic Choosing Problems -- On the degrees of constructively immune sets -- Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry -- The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines -- Randomising Realizability -- Restrictions of Hindman's Theorem: an overview -- Complexity and Categoricity of Automatic Injection structures -- A tale of optimizing the space taken by de Bruijn graphs -- Formally Computing with the Non-Computable -- Cohen Mapping Monotonic Restrictions in Inductive Inference -- Normal Forms for Semantically Witness-Based Learners in Inductive Inference -- xWalk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted -- On 3SUM-hard problems in the Decision Tree Model -- Monotonic Spectra and TheirGeneralizations -- On false Heine/Borel compactness principles in proof mining -- Placing Green Bridges Optimally, with a Multivariate Analysis -- A Church-Turing thesis for randomness? -- Probabilistic Models of k-mer Frequencies -- Defining Formal Explanation in Classical Logic by Substructural Derivability -- Dedekind Cuts and Long Strings of Zeros in Base Expansions -- On the impact of treewidth in the computational complexity of freezing dynamics -- Towards a Map for Incremental Learning in the Limit from Positive and Negative Information -- On preserving the computational content of mathematical proofs: toy examples for a formalising strategy -- n search of the first-order part of Ramsey's theorem for pairs -- On subrecursive representability of irrational numbers: Contractors and Baire sequences -- xiLearning -- Languages in the Limit from Positive Information with Finitely Many Memory Changes. Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 17th Conference on Computability in Europe, CiE 2021, organized by the University of Ghent in July 2021. Due to COVID-19 pandemic the conference was held virtually. The 48 full papers presented in this volume were carefully reviewed and selected from 50 submissions. CiE promotes the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences, such as physics and biology, as well as related fields, such as philosophy and history of computing. CiE 2021 had as its motto Connecting with Computability, a clear acknowledgement of the connecting and interdisciplinary nature of the conference series which is all the more important in a time where people are more than ever disconnected from one another due to the COVID-19 pandemic. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Connecting with Computability : 17th Conference on Computability in Europe, CiE 2021, Virtual Event, Ghent, July 5–9, 2021, Proceedings / [documento electrónico] / De Mol, Liesbeth, ; Weiermann, Andreas, ; Manea, Florin, ; Fernández-Duque, David, . - 1 ed. . - [s.l.] : Springer, 2021 . - XXIV, 506 p. 30 ilustraciones, 16 ilustraciones en color.
ISBN : 978-3-030-80049-9
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
Idioma : Inglés (eng)
Palabras clave: Algoritmos Ciencias de la Computación Informática Inteligencia artificial Estructuras de datos (Informática) TeorÃa de la información TeorÃa de la Computación Matemáticas de la Computación Estructuras de datos y teorÃa de la información Lógica informática y fundamentos de la programación. Clasificación: 518.1 Resumen: Este libro constituye las actas de la 17.ª Conferencia sobre Computabilidad en Europa, CiE 2021, organizada por la Universidad de Gante en julio de 2021. Debido a la pandemia de COVID-19, la conferencia se celebró de forma virtual. Los 48 artÃculos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 50 presentaciones. CiE promueve el desarrollo de ciencias relacionadas con la computabilidad, que abarcan las matemáticas, la informática y aplicaciones en diversas ciencias naturales y de ingenierÃa, como la fÃsica y la biologÃa, asà como campos relacionados, como la filosofÃa y la historia de la informática. CiE 2021 tuvo como lema Conectar con Computabilidad, un claro reconocimiento de la naturaleza conectora e interdisciplinaria de la serie de conferencias, que es aún más importante en una época en la que las personas están más desconectadas que nunca unas de otras debido a la pandemia de COVID-19. Nota de contenido: Searching for Applicable Versions of Computable Structures -- On Measure Quantifiers in First-Order Arithmetic -- Pistone Learning Languages with Decidable Hypotheses -- Robust Online Algorithms for Dynamic Choosing Problems -- On the degrees of constructively immune sets -- Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry -- The Lost Melody Theorem for Infinite Time Blum-Shub-Smale Machines -- Randomising Realizability -- Restrictions of Hindman's Theorem: an overview -- Complexity and Categoricity of Automatic Injection structures -- A tale of optimizing the space taken by de Bruijn graphs -- Formally Computing with the Non-Computable -- Cohen Mapping Monotonic Restrictions in Inductive Inference -- Normal Forms for Semantically Witness-Based Learners in Inductive Inference -- xWalk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted -- On 3SUM-hard problems in the Decision Tree Model -- Monotonic Spectra and TheirGeneralizations -- On false Heine/Borel compactness principles in proof mining -- Placing Green Bridges Optimally, with a Multivariate Analysis -- A Church-Turing thesis for randomness? -- Probabilistic Models of k-mer Frequencies -- Defining Formal Explanation in Classical Logic by Substructural Derivability -- Dedekind Cuts and Long Strings of Zeros in Base Expansions -- On the impact of treewidth in the computational complexity of freezing dynamics -- Towards a Map for Incremental Learning in the Limit from Positive and Negative Information -- On preserving the computational content of mathematical proofs: toy examples for a formalising strategy -- n search of the first-order part of Ramsey's theorem for pairs -- On subrecursive representability of irrational numbers: Contractors and Baire sequences -- xiLearning -- Languages in the Limit from Positive Information with Finitely Many Memory Changes. Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 17th Conference on Computability in Europe, CiE 2021, organized by the University of Ghent in July 2021. Due to COVID-19 pandemic the conference was held virtually. The 48 full papers presented in this volume were carefully reviewed and selected from 50 submissions. CiE promotes the development of computability-related science, ranging over mathematics, computer science and applications in various natural and engineering sciences, such as physics and biology, as well as related fields, such as philosophy and history of computing. CiE 2021 had as its motto Connecting with Computability, a clear acknowledgement of the connecting and interdisciplinary nature of the conference series which is all the more important in a time where people are more than ever disconnected from one another due to the COVID-19 pandemic. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
TÃtulo : Sailing Routes in the World of Computation : 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 – August 3, 2018, Proceedings / Tipo de documento: documento electrónico Autores: Manea, Florin, ; Miller, Russell G., ; Nowotka, Dirk, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2018 Número de páginas: XV, 434 p. 28 ilustraciones ISBN/ISSN/DL: 978-3-319-94418-0 Nota general: Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés (eng) Palabras clave: Informática Análisis numérico Ciencias de la Computación Aplicaciones matemáticas en informática TeorÃa de la Computación Operaciones de TI Clasificación: 40.151 Resumen: Este libro constituye las actas arbitradas de la 14.ª Conferencia sobre Computabilidad en Europa, CiE 2018, celebrada en Kiel, Alemania, en julio/agosto de 2017. Los 26 artÃculos completos revisados ​​fueron cuidadosamente revisados ​​y seleccionados entre 55 presentaciones. Además, este volumen incluye 15 ponencias invitadas. La conferencia CiE 2018 cuenta con seis sesiones especiales, a saber: Aproximación y optimización, Bioinformática y computación bioinspirada, Computación con información imperfecta, Computación continua, Historia y filosofÃa de la computación (celebrando el 80 cumpleaños de Martin Davis) y Resolución de SAT. Nota de contenido: A Journey To Computably Enumerable Structures (Tutorial Lectures) -- Polynomial-time Presentations of Algebraic Number Fields (Extended abstract) -- Multiple Permitting and Array Noncomputability -- Degrees of Categoricity for Prime and Homogeneous Models -- Universality in Freezing Cellular Automata -- A Deontic Logic Reasoning Infrastructure -- Optimised Program Extraction for Induction and Coinduction -- Computing Tree Width: From Theory to Practice and Back -- Using Structural Properties for Integer Programs -- From Eventually Different Functions to Pandemic Numberings -- Divide and Conquer Computation of the Multi-String BWT and LCP Array -- Some Observations on Infinitary Complexity -- Taming Koepke's Zoo -- Online Computability and Differentiation in the Cantor Space -- Turing's Vision and Deep Learning -- Computing and Scheduling with Explorable Uncertainty -- Diminishable Parameterized Problems and Strict Polynomial Kernelization -- New Nonterminal Complexity Results for Semi-Conditional Grammars -- Kernelization Lower Bounds for Finding Constant-Size Subgraphs -- On General Sum Approximations of Irrational Numbers -- Computability of Ordinary Differential Equations -- Topological Analysis of Representations -- A Unified Framework for Designing EPTAS's for Load Balancing on Parallel Machines -- Weak Reduction Principle and Computable Metric Spaces -- Decidable and Undecidable Fragments of First-Order Concatenation Theory -- Algorithm Analysis through Proof Complexity -- Computing with SAT Oracles: Past, Present & Future -- The Isometry Degree of a Computable Copy of â„“áµ– -- Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms -- A c.e. Weak Truth Table Degree which is Array Noncomputable and r-maximal -- The Complexity of Tukey Types and Cofinal Types -- Functionals of Type 3 as Realisers of Classical Theorems in Analysis -- Enumeration Degrees and Topology -- A Taxonomy of Deviant Encodings -- Elementary Bi-embeddability Spectra of Structures -- A Generic m-reducibility -- Some Nonstandard Equivalences in Reverse Mathematics -- Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended abstract) -- What is the Concept of Computation? -- Witness Hiding without Extractors or Simulators -- Algorithms and Geometric Constructions -- Computing with Multisets : A Survey on Reaction Automata Theory. Tipo de medio : Computadora Summary : This book constitutes the refereed proceedings of the 14th Conference on Computability in Europe, CiE 2018, held in Kiel, Germany, in July/ August 2017. The 26 revised full papers were carefully reviewed and selected from 55 submissions. In addition, this volume includes 15 invited papers. The conference CiE 2018 has six special sessions, namely: Approximation and optimization, Bioinformatics and bio-inspired computing, computing with imperfect information, continuous computation, history and philosophy of computing (celebrating the 80th birthday of Martin Davis), and SAT-solving. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Sailing Routes in the World of Computation : 14th Conference on Computability in Europe, CiE 2018, Kiel, Germany, July 30 – August 3, 2018, Proceedings / [documento electrónico] / Manea, Florin, ; Miller, Russell G., ; Nowotka, Dirk, . - 1 ed. . - [s.l.] : Springer, 2018 . - XV, 434 p. 28 ilustraciones.
ISBN : 978-3-319-94418-0
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
Idioma : Inglés (eng)
Palabras clave: Informática Análisis numérico Ciencias de la Computación Aplicaciones matemáticas en informática TeorÃa de la Computación Operaciones de TI Clasificación: 40.151 Resumen: Este libro constituye las actas arbitradas de la 14.ª Conferencia sobre Computabilidad en Europa, CiE 2018, celebrada en Kiel, Alemania, en julio/agosto de 2017. Los 26 artÃculos completos revisados ​​fueron cuidadosamente revisados ​​y seleccionados entre 55 presentaciones. Además, este volumen incluye 15 ponencias invitadas. La conferencia CiE 2018 cuenta con seis sesiones especiales, a saber: Aproximación y optimización, Bioinformática y computación bioinspirada, Computación con información imperfecta, Computación continua, Historia y filosofÃa de la computación (celebrando el 80 cumpleaños de Martin Davis) y Resolución de SAT. Nota de contenido: A Journey To Computably Enumerable Structures (Tutorial Lectures) -- Polynomial-time Presentations of Algebraic Number Fields (Extended abstract) -- Multiple Permitting and Array Noncomputability -- Degrees of Categoricity for Prime and Homogeneous Models -- Universality in Freezing Cellular Automata -- A Deontic Logic Reasoning Infrastructure -- Optimised Program Extraction for Induction and Coinduction -- Computing Tree Width: From Theory to Practice and Back -- Using Structural Properties for Integer Programs -- From Eventually Different Functions to Pandemic Numberings -- Divide and Conquer Computation of the Multi-String BWT and LCP Array -- Some Observations on Infinitary Complexity -- Taming Koepke's Zoo -- Online Computability and Differentiation in the Cantor Space -- Turing's Vision and Deep Learning -- Computing and Scheduling with Explorable Uncertainty -- Diminishable Parameterized Problems and Strict Polynomial Kernelization -- New Nonterminal Complexity Results for Semi-Conditional Grammars -- Kernelization Lower Bounds for Finding Constant-Size Subgraphs -- On General Sum Approximations of Irrational Numbers -- Computability of Ordinary Differential Equations -- Topological Analysis of Representations -- A Unified Framework for Designing EPTAS's for Load Balancing on Parallel Machines -- Weak Reduction Principle and Computable Metric Spaces -- Decidable and Undecidable Fragments of First-Order Concatenation Theory -- Algorithm Analysis through Proof Complexity -- Computing with SAT Oracles: Past, Present & Future -- The Isometry Degree of a Computable Copy of â„“áµ– -- Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms -- A c.e. Weak Truth Table Degree which is Array Noncomputable and r-maximal -- The Complexity of Tukey Types and Cofinal Types -- Functionals of Type 3 as Realisers of Classical Theorems in Analysis -- Enumeration Degrees and Topology -- A Taxonomy of Deviant Encodings -- Elementary Bi-embeddability Spectra of Structures -- A Generic m-reducibility -- Some Nonstandard Equivalences in Reverse Mathematics -- Bit Complexity of Computing Solutions for Symmetric Hyperbolic Systems of PDEs (Extended abstract) -- What is the Concept of Computation? -- Witness Hiding without Extractors or Simulators -- Algorithms and Geometric Constructions -- Computing with Multisets : A Survey on Reaction Automata Theory. Tipo de medio : Computadora Summary : This book constitutes the refereed proceedings of the 14th Conference on Computability in Europe, CiE 2018, held in Kiel, Germany, in July/ August 2017. The 26 revised full papers were carefully reviewed and selected from 55 submissions. In addition, this volume includes 15 invited papers. The conference CiE 2018 has six special sessions, namely: Approximation and optimization, Bioinformatics and bio-inspired computing, computing with imperfect information, continuous computation, history and philosophy of computing (celebrating the 80th birthday of Martin Davis), and SAT-solving. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
TÃtulo : Unveiling Dynamics and Complexity : 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings Tipo de documento: documento electrónico Autores: Kari, Jarkko, ; Manea, Florin, ; Petre, Ion, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2017 Número de páginas: XIII, 401 p. 57 ilustraciones ISBN/ISSN/DL: 978-3-319-58741-7 Nota general: Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés (eng) Palabras clave: Ciencias de la Computación Algoritmos Inteligencia artificial Sistemas de reconocimiento de patrones Informática Matemáticas discretas TeorÃa de las máquinas TeorÃa de la Computación Reconocimiento de patrones automatizado Matemáticas discretas en informática Lenguajes formales y teorÃa de los autómatas Clasificación: 40.151 Resumen: Este libro constituye las actas arbitradas de la 13.ª Conferencia sobre Computabilidad en Europa, CiE 2017, celebrada en Turku, Finlandia, en junio de 2017. Los 24 artÃculos completos revisados ​​y los 12 artÃculos invitados fueron cuidadosamente revisados ​​y seleccionados entre 69 presentaciones. La conferencia CiE 2016 cuenta con seis sesiones especiales, a saber: algorÃtmica para biologÃa; combinatoria y algorÃtmica de palabras; computabilidad en análisis, álgebra y geometrÃa; criptografÃa y teorÃa de la información; lenguajes formales y teorÃa de autómatas; e historia y filosofÃa de la informática. Nota de contenido: Algorithmics for biology -- Combinatorics and algorithmics on words -- Computability in analysis, algebra, and geometry.-Cryptography and information theory -- Formal languages and automata theory -- History and philosophy of computing. Tipo de medio : Computadora Summary : This book constitutes the refereed proceedings of the 13th Conference on Computability in Europe, CiE 2017, held in Turku, Finland, in June 2017. The 24 revised full papers and 12 invited papers were carefully reviewed and selected from 69 submissions. The conference CiE 2016 has six special sessions, namly: algorithmics for biology; combinatorics and algorithmics on words; computability in analysis, algebra, and geometry; cryptography and information theory; formal languages and automata theory; and history and philosophy of computing. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Unveiling Dynamics and Complexity : 13th Conference on Computability in Europe, CiE 2017, Turku, Finland, June 12-16, 2017, Proceedings [documento electrónico] / Kari, Jarkko, ; Manea, Florin, ; Petre, Ion, . - 1 ed. . - [s.l.] : Springer, 2017 . - XIII, 401 p. 57 ilustraciones.
ISBN : 978-3-319-58741-7
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
Idioma : Inglés (eng)
Palabras clave: Ciencias de la Computación Algoritmos Inteligencia artificial Sistemas de reconocimiento de patrones Informática Matemáticas discretas TeorÃa de las máquinas TeorÃa de la Computación Reconocimiento de patrones automatizado Matemáticas discretas en informática Lenguajes formales y teorÃa de los autómatas Clasificación: 40.151 Resumen: Este libro constituye las actas arbitradas de la 13.ª Conferencia sobre Computabilidad en Europa, CiE 2017, celebrada en Turku, Finlandia, en junio de 2017. Los 24 artÃculos completos revisados ​​y los 12 artÃculos invitados fueron cuidadosamente revisados ​​y seleccionados entre 69 presentaciones. La conferencia CiE 2016 cuenta con seis sesiones especiales, a saber: algorÃtmica para biologÃa; combinatoria y algorÃtmica de palabras; computabilidad en análisis, álgebra y geometrÃa; criptografÃa y teorÃa de la información; lenguajes formales y teorÃa de autómatas; e historia y filosofÃa de la informática. Nota de contenido: Algorithmics for biology -- Combinatorics and algorithmics on words -- Computability in analysis, algebra, and geometry.-Cryptography and information theory -- Formal languages and automata theory -- History and philosophy of computing. Tipo de medio : Computadora Summary : This book constitutes the refereed proceedings of the 13th Conference on Computability in Europe, CiE 2017, held in Turku, Finland, in June 2017. The 24 revised full papers and 12 invited papers were carefully reviewed and selected from 69 submissions. The conference CiE 2016 has six special sessions, namly: algorithmics for biology; combinatorics and algorithmics on words; computability in analysis, algebra, and geometry; cryptography and information theory; formal languages and automata theory; and history and philosophy of computing. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
