Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Merlin Carl"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 16, Issue 2 (2020)
Infinite time Turing machine models with tape length $\alpha$, denoted $T_\alpha$, strengthen the machines of Hamkins and Kidder [HL00] with tape length $\omega$. A new phenomenon is that for some countable ordinals $\alpha$, some cells cannot be hal
Externí odkaz:
https://doaj.org/article/6d2fb1ef22cd489bab2670ac03ac74f8
Autor:
Merlin Carl
Publikováno v:
Computability. 11:41-56
An important theorem in classical complexity theory is that REG = LOGLOGSPACE, i.e., that languages decidable with double-logarithmic space bound are regular. We consider a transfinite analogue of this theorem. To this end, we introduce deterministic
Autor:
Merlin Carl
Publikováno v:
Synthese. 200
The work done so far on the understanding of mathematical (proof) texts focuses mostly on logical and heuristical aspects; a proof text is considered to be understood when the reader is able to justify inferential steps occurring in it, to defend it
Publikováno v:
Axiomathes. 31:649-676
The frame concept from linguistics, cognitive science and artificial intelligence is a theoretical tool to model how explicitly given information is combined with expectations deriving from background knowledge. In this paper, we show how the frame c
Autor:
Merlin Carl
Publikováno v:
ThEdu@IJCAR
Diproche ("Didactical Proof Checking") is an automatic system for supporting the acquistion of elementary proving skills in the initial phase of university education in mathematics. A key feature of Diproche - which is designed by the example of the
Autor:
Merlin Carl
Publikováno v:
Journal of Logic and Computation. 30:1239-1255
We consider notions of space by Winter [21, 22]. We answer several open questions about these notions, among them whether low space complexity implies low time complexity (it does not) and whether one of the equalities P=PSPACE, P$_{+}=$PSPACE$_{+}$
Autor:
Merlin Carl
Publikováno v:
Revolutions and Revelations in Computability ISBN: 9783031087394
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e82278e43966dfafd3e73d7b3b85cfff
https://doi.org/10.1007/978-3-031-08740-0_6
https://doi.org/10.1007/978-3-031-08740-0_6
Autor:
Michael Schmitz, Merlin Carl
Publikováno v:
Mathematische Semesterberichte. 67:237-261
We describe in the form of a dialogue a development of various reflections on the combinatorics of set partitions; among the topics we pursue are the number of ways of partitioning a finite set into a fixed number $$d$$ of subsets of odd or even size
Autor:
Merlin Carl, Michael Schmitz
We describe in dialogue form a possible way of discovering and investigating 10-adic numbers starting from the naive question about a `largest natural number'. Among the topics we pursue are possibilities of extensions to transfinite 10-adic numbers,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::dfb7f5b8b0e69103ca41f8fbfc1832d8
http://arxiv.org/abs/2106.01408
http://arxiv.org/abs/2106.01408
Autor:
Merlin Carl, Lothar Sebastian Krapp
Publikováno v:
Journal of Logic and Analysis. 13
Exploring further the connection between exponentiation on real closed fields and the existence of an integer part modelling strong fragments of arithmetic, we demonstrate that each model of true arithmetic is an integer part of an exponential real c