Zobrazeno 1 - 10
of 84
pro vyhledávání: '"Jakob Grue Simonsen"'
Autor:
Jean-Yves Moyen, Jakob Grue Simonsen
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 248, Iss Proc. DICE-FOPARA 2017, Pp 38-46 (2017)
We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time decidable e
Externí odkaz:
https://doaj.org/article/911ca9d287f0474d8877e12af6ae9ab9
Autor:
Cynthia Kop, Jakob Grue Simonsen
Publikováno v:
Logical Methods in Computer Science, Vol Volume 13, Issue 3 (2017)
Constructor rewriting systems are said to be cons-free if, roughly, constructor terms in the right-hand sides of rules are subterms of the left-hand sides; the computational intuition is that rules cannot build new data structures. In programming lan
Externí odkaz:
https://doaj.org/article/7bc93760891f4cdabca605864da314d4
Autor:
Jeroen Ketema, Jakob Grue Simonsen
Publikováno v:
Logical Methods in Computer Science, Vol Volume 6, Issue 1 (2010)
We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a
Externí odkaz:
https://doaj.org/article/a9da3cda982a4ad18204762ddca38577
Autor:
Jeroen Ketema, Jakob Grue Simonsen
Publikováno v:
Logical Methods in Computer Science, Vol Volume 5, Issue 4 (2009)
We study confluence in the setting of higher-order infinitary rewriting, in particular for infinitary Combinatory Reduction Systems (iCRSs). We prove that fully-extended, orthogonal iCRSs are confluent modulo identification of hypercollapsing subterm
Externí odkaz:
https://doaj.org/article/76d3d7add4984cb6b2264c2916c9eca4
Autor:
Jakob Grue Simonsen
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol 8, Iss 1 (2006)
We prove that the topological entropy of subshifts having decidable language is uncomputable in the following sense: For no error bound less than 1/4 does there exists a program that, given a decision procedure for the language of a subshift as input
Externí odkaz:
https://doaj.org/article/687eb81b674f4c1795b7e2aed2074847
Autor:
Jakub Dargaj, Jakob Grue Simonsen
Publikováno v:
Dargaj, J & Simonsen, J G 2022, ' Discounted Repeated Games Having Computable Strategies with No Computable Best Response under Subgame-Perfect Equilibria ', ACM Transactions on Economics and Computation, vol. 10, no. 1, 3, pp. 1-39 . https://doi.org/10.1145/3505585
A classic result in computational game theory states that there are infinitely repeated games where one player has a computable strategy that has a best response, but no computable best response. For games with discounted payoff, the result is known
Publikováno v:
Theory of Computing Systems, 67, pp. 437-472
Contains fulltext : 294467.pdf (Publisher’s version ) (Closed access) 29 juni 2022
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::999641377cc65d5b8cae7ff715d22e36
https://repository.ubn.ru.nl/handle/2066/294467
https://repository.ubn.ru.nl/handle/2066/294467
Autor:
Pernille Bjørn, Naja L. Holten Møller, Jakob Grue Simonsen, Gina Neff, Jonas Christoffer Villumsen
Publikováno v:
Proceedings of the ACM on Human-Computer Interaction. 5:1-21
People are increasingly subject to the tracking of data about them at their workplaces. Sensor tracking is used by organizations to generate data on the movement and interaction of their employees to monitor and manage workers, and yet this data also
Autor:
Peng Zhang, Wenjie Hui, Benyou Wang, Donghao Zhao, Dawei Song, Christina Lioma, Jakob Grue Simonsen
Publikováno v:
Zhang, P, Hui, W, Wang, B, Zhao, D, Song, D, Lioma, C & Simonsen, J G 2022, ' Complex-valued Neural Network-based Quantum Language Models ', ACM Transactions on Information Systems, vol. 40, no. 4, 84 . https://doi.org/10.1145/3505138
Language modeling is essential in Natural Language Processing and Information Retrieval related tasks. After the statistical language models, Quantum Language Model (QLM) has been proposed to unify both single words and compound terms in the same pro
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5bf29561192e4759dda5a38f8a5602b3
https://curis.ku.dk/ws/files/357081711/Complex_valued_Neural_Network_based_Quantum_Language.pdf
https://curis.ku.dk/ws/files/357081711/Complex_valued_Neural_Network_based_Quantum_Language.pdf
Publikováno v:
Atanasova, P, Simonsen, J G, Lioma, C & Augenstein, I 2022, ' Fact Checking with Insufficient Evidence ', Transactions of the Association for Computational Linguistics, vol. 10, pp. 746-763 . https://doi.org/10.1162/tacl_a_00486
Automating the fact checking (FC) process relies on information obtained from external sources. In this work, we posit that it is crucial for FC models to make veracity predictions only when there is sufficient evidence and otherwise indicate when it
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a518b964bf20043ba74a1adce332d695