×

Found 2,962 Documents (Results 1–100)

Mining the surface: witnessing the low complexity theorems of arithmetic. (English) Zbl 07691335

Ciabattoni, Agata (ed.) et al., Logic, language, information, and computation. 28th international workshop, WoLLIC 2022, Iași, Romania, September 20–23, 2022. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 13468, 378-394 (2022).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI

Computability. Randomness, reverse mathematics and hypercomputability. (Calculabilité. Aléatoire, mathématiques à rebours et hypercalculabilité.) (French) Zbl 1516.03001

Tableau Noir 107. Paris: Calvage et Mounet (ISBN 978-2-916352-96-1/hbk). xxii, 828 p. (2022).
PDF BibTeX XML Cite

Support of an algebraic series as the range of a recursive sequence. (English) Zbl 1498.11082

Bostan, Alin (ed.) et al., Transcendence in algebra, combinatorics, geometry and number theory. TRANS19 – transient transcendence in Transylvania, Brașov, Romania, May 13–17, 2019. Revised and extended contributions. Cham: Springer. Springer Proc. Math. Stat. 373, 437-449 (2021).
MSC:  11B85 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Degrees of enumerations of countable Wehner-like families. (English. Russian original) Zbl 07364538

J. Math. Sci., New York 256, No. 1, 51-60 (2021); translation from Itogi Nauki Tekh., Ser. Sovrem. Mat. Prilozh., Temat. Obz. 157, 59-69 (2018).
MSC:  03D20 03D45
PDF BibTeX XML Cite
Full Text: DOI

On the existence of hidden machines in computational time hierarchies. (English) Zbl 1496.03164

de Barros, J. Acacio (ed.) et al., A true polymath. A tribute to Francisco Antonio Doria. Based on the meeting, Rio de Janeiro, Brazil, December 2018. [s.l.]: College Publications. Acad. Bras. Filos. 2, 113-121 (2020).
MSC:  03D15 03D20 68Q15
PDF BibTeX XML Cite
Full Text: arXiv

Do we need recursion? (English) Zbl 1505.03085

Sedlár, Igor (ed.) et al., The Logica yearbook 2019. Selected papers based on the presentations at the symposium Logica 2019, Hejnice, Czech Republic, June 24–28, 2019. London: College Publications. 193-204 (2020).
MSC:  03D20 03D75
PDF BibTeX XML Cite

Complexity of controlled bad sequences over finite sets of \(\mathbb{N}^d\). (English) Zbl 1499.06006

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 130-140 (2020).
MSC:  06A07 03D20
PDF BibTeX XML Cite
Full Text: DOI arXiv

Adaptive global optimization based on a block-recursive dimensionality reduction scheme. (English. Russian original) Zbl 1457.90117

Autom. Remote Control 81, No. 8, 1475-1485 (2020); translation from Avtom. Telemekh. 2020, No. 8, 136-148 (2020).
MSC:  90C26
PDF BibTeX XML Cite
Full Text: DOI

Computability. Models of computation and undecidability. (Berechenbarkeit. Berechnungsmodelle und Unentscheidbarkeit.) (German) Zbl 1452.68002

Essentials. Wiesbaden: Springer Spektrum (ISBN 978-3-658-31738-6/pbk; 978-3-658-31739-3/ebook). xiii, 67 p. (2020).
PDF BibTeX XML Cite
Full Text: DOI

Aspects of scattering amplitudes and moduli space localization. (English) Zbl 1457.81067

Springer Theses. Cham: Springer; Waterloo: University of Waterloo (Diss.) (ISBN 978-3-030-53009-9/hbk; 978-3-030-53012-9/pbk; 978-3-030-53010-5/ebook). xvii, 134 p. (2020).
PDF BibTeX XML Cite
Full Text: DOI arXiv

Boolean monadic recursive schemes as a logical characterization of the subsequential functions. (English) Zbl 1437.68042

Leporati, Alberto (ed.) et al., Language and automata theory and applications. 14th international conference, LATA 2020, Milan, Italy, March 4–6, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12038, 157-169 (2020).
PDF BibTeX XML Cite
Full Text: DOI

Filter Results by …

Document Type

Database

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software