國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Beyond the horizon of computability1...

(1998 :)

Beyond the horizon of computability16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29-July 3, 2020 : proceedings /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Beyond the horizon of computabilityedited by Marcella Anselmo ... [et al.].
其他題名:	16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29-July 3, 2020 : proceedings /
其他題名:	CiE 2020
其他作者:	Anselmo, Marcella.
團體作者:
出版者:	Cham :Springer International Publishing :2020.
面頁冊數:	xxxvii, 379 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computable functionsCongresses.
電子資源:	https://doi.org/10.1007/978-3-030-51466-2
ISBN:	9783030514662$q(electronic bk.)

Beyond the horizon of computability16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29-July 3, 2020 : proceedings /
Beyond the horizon of computability16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29-July 3, 2020 : proceedings /[electronic resource] :CiE 2020edited by Marcella Anselmo ... [et al.]. - Cham :Springer International Publishing :2020. - xxxvii, 379 p. :ill., digital ;24 cm. - Lecture notes in computer science,120980302-9743 ;. - Lecture notes in computer science ;4891..

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 Lukasiewicz 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.

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.

ISBN: 9783030514662$q(electronic bk.)

Standard No.: 10.1007/978-3-030-51466-2doiSubjects--Topical Terms:

437625
Computable functions
--Congresses.

LC Class. No.: QA9.59 / .C67 2020

Dewey Class. No.: 511.352

Beyond the horizon of computability16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29-July 3, 2020 : proceedings /
LDR:04158nmm a2200361 a 4500 001 580427
003 DE-He213
005 20200623141931.0
006 m
007 cr
008 210105s2020
020 $a 9783030514662$q(electronic bk.)
020 $a 9783030514655$q(paper)
024 7 $a 10.1007/978-3-030-51466-2 $2 doi
035 $a 978-3-030-51466-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA9.59 $b .C67 2020
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 511.352 $2 23
090 $a QA9.59 $b .C748 2020
111 2 $n (3rd : $d 1998 : $c Amsterdam, Netherlands) $3 194767
245 1 0 $a Beyond the horizon of computability $h [electronic resource] : $b 16th Conference on Computability in Europe, CiE 2020, Fisciano, Italy, June 29-July 3, 2020 : proceedings / $c edited by Marcella Anselmo ... [et al.].
246 3 $a CiE 2020
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2020.
300 $a xxxvii, 379 p. : $b ill., digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 12098
490 1 $a Theoretical computer science and general issues
505 0 $a 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 Lukasiewicz 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.
520 $a 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.
650 0 $a Computable functions $v Congresses. $3 437625
650 0 $a Computer science $x Mathematics $3 253427
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 273702
700 1 $a Anselmo, Marcella. $3 870240
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
830 0 $a Theoretical computer science and general issues. $3 822018
856 4 0 $u https://doi.org/10.1007/978-3-030-51466-2
950 $a Computer Science (Springer-11645)