Lecture Notes in Computer Science - Connecting with Computability
Latest Publications

TOTAL DOCUMENTS

44

(FIVE YEARS 44)

H-INDEX

0

(FIVE YEARS 0)

Published By Springer International Publishing

9783030800482, 9783030800499

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Minimum Classical Extensions of Constructive Theories

Lecture Notes in Computer Science - Connecting with Computability ◽

10.1007/978-3-030-80049-9_33 ◽

2021 ◽

pp. 353-362

Author(s):

Joan Rand Moschovakis ◽

Garyfallia Vafeiadou

Download Full-text

Compression Techniques in Group Theory

Lecture Notes in Computer Science - Connecting with Computability ◽

10.1007/978-3-030-80049-9_30 ◽

2021 ◽

pp. 330-341

Author(s):

Markus Lohrey

Keyword(s):

Download Full-text

Towards a Map for Incremental Learning in the Limit from Positive and Negative Information

Lecture Notes in Computer Science - Connecting with Computability ◽

10.1007/978-3-030-80049-9_25 ◽

2021 ◽

pp. 273-284

Author(s):

Ardalan Khazraei ◽

Timo Kötzing ◽

Karen Seidel

Keyword(s):

Incremental Learning ◽

Negative Information ◽

Learning In The Limit

Download Full-text

Effective Inseparability and Its Applications

Lecture Notes in Computer Science - Connecting with Computability ◽

10.1007/978-3-030-80049-9_41 ◽

2021 ◽

pp. 417-423

Author(s):

Andrea Sorbi

Download Full-text

Einstein Meets Turing: The Computability of Nonlocal Games

Lecture Notes in Computer Science - Connecting with Computability ◽

10.1007/978-3-030-80049-9_47 ◽

2021 ◽

pp. 483-493

Author(s):

Henry Yuen

Download Full-text

On Preserving the Computational Content of Mathematical Proofs: Toy Examples for a Formalising Strategy

Lecture Notes in Computer Science - Connecting with Computability ◽

10.1007/978-3-030-80049-9_26 ◽

2021 ◽

pp. 285-296

Author(s):

Angeliki Koutsoukou-Argyraki

Keyword(s):

Mathematical Proofs

Download Full-text

An Algorithmic Version of Zariski’s Lemma

Lecture Notes in Computer Science - Connecting with Computability ◽

10.1007/978-3-030-80049-9_46 ◽

2021 ◽

pp. 469-482

Author(s):

Franziskus Wiesnet

Download Full-text

Searching for Applicable Versions of Computable Structures

Lecture Notes in Computer Science - Connecting with Computability ◽

10.1007/978-3-030-80049-9_1 ◽

2021 ◽

pp. 1-11

Author(s):

P. E. Alaev ◽

V. L. Selivanov

Keyword(s):

Computable Structures

Download Full-text

A Church-Turing Thesis for Randomness?

Lecture Notes in Computer Science - Connecting with Computability ◽

10.1007/978-3-030-80049-9_20 ◽

2021 ◽

pp. 217-226

Author(s):

Johanna N. Y. Franklin

Download Full-text

Normal Forms for Semantically Witness-Based Learners in Inductive Inference

Lecture Notes in Computer Science - Connecting with Computability ◽

10.1007/978-3-030-80049-9_14 ◽

2021 ◽

pp. 158-168

Author(s):

Vanja Doskoč ◽

Timo Kötzing

Keyword(s):

Normal Forms ◽

Inductive Inference

Download Full-text