Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Jayson Lynch"'
Autor:
Iddo Drori, Sarah Zhang, Reece Shuttleworth, Leonard Tang, Albert Lu, Elizabeth Ke, Kevin Liu, Linda Chen, Sunny Tran, Newman Cheng, Roman Wang, Nikhil Singh, Taylor L. Patti, Jayson Lynch, Avi Shporer, Nakul Verma, Eugene Wu, Gilbert Strang
Publikováno v:
Proceedings of the National Academy of Sciences of the United States of America. 119(32)
We demonstrate that a neural network pre-trained on text and fine-tuned on code solves mathematics course problems, explains solutions, and generates new questions at a human level. We automatically synthesize programs using few-shot learning and Ope
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0780c0feaff66479f009a6fe9fa92f83
https://pubmed.ncbi.nlm.nih.gov/35917350
https://pubmed.ncbi.nlm.nih.gov/35917350
Autor:
Jayson Lynch, Michael J. Coulombe
Publikováno v:
Theoretical Computer Science. 839:30-40
We show the undecidability of whether a team has a forced win in a number of well known video games including: Team Fortress 2, Super Smash Brothers: Brawl, and Mario Kart. To do so, we give a simplification of the Team Computation Game from Hearn an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a9732fc930fb2eb221ee1bfff590b7b4
https://doi.org/10.1016/j.tcs.2020.05.028
https://doi.org/10.1016/j.tcs.2020.05.028
Autor:
Adam Hesterberg, Michael J. Coulombe, Erik D. Demaine, Mihir Singhal, Jayson Lynch, Sualeh Asif, Martin L. Demaine
Publikováno v:
Journal of Information Processing. 28:942-958
We prove that the classic falling-block video game Tetris (both survival and board clearing) remains NP-complete even when restricted to 8 columns, or to 4 rows, settling open problems posed over 15 years ago [BDH+04]. Our reduction is from 3-Partiti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1c4412e4dae7dde8328c9c59c6088779
https://doi.org/10.2197/ipsjjip.28.942
https://doi.org/10.2197/ipsjjip.28.942
Publikováno v:
Journal of Information Processing. 28:919-928
We consider the computational complexity of winning this turn (mate-in-1 or "finding lethal") in Hearthstone as well as several other single turn puzzle types introduced in the Boomsday Lab expansion. We consider three natural generalizations of Hear
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0257cac888e37e0cf78678b61feb7eec
https://doi.org/10.2197/ipsjjip.28.919
https://doi.org/10.2197/ipsjjip.28.919
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783031135019
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::55240bb7c8261fce9dc2f8d022c91fe6
https://doi.org/10.1007/978-3-031-13502-6_7
https://doi.org/10.1007/978-3-031-13502-6_7
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030967307
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8207b387ae8f8a852d61e828fcbae336
https://doi.org/10.1007/978-3-030-96731-4_16
https://doi.org/10.1007/978-3-030-96731-4_16
Publikováno v:
WALCOM: Algorithms and Computation ISBN: 9783030967307
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a895a4c5b191450819127d2c3d0a265f
https://doi.org/10.1007/978-3-030-96731-4_5
https://doi.org/10.1007/978-3-030-96731-4_5
Autor:
Michael Coulombe, Jayson Lynch
In this paper we define a new model of limited communication for multiplayer team games of imperfect information. We prove that the Team DFA Game and Team Formula Game, which have bounded state, remain undecidable when players have a rate of communic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b80eef91606cf58ce76e9aa882b4906f
Autor:
André van Renssen, Jayson Lynch, Adam Hesterberg, Man-Kwun Chiu, Erik D. Demaine, Zachary Abel, Martin L. Demaine, Hugo A. Akitaya, Marcel Roeloffzen, Matias Korman
Publikováno v:
Computational Geometry, 98:101784. Elsevier
We study Snipperclips, a computer puzzle game whose objective is to create a target shape with two tools. The tools start as constant-complexity shapes, and each tool can snip (i.e., subtract its current shape from) the other tool. We study the compu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7f6cb85ab3fbbaf338765248a31dd4f3
https://doi.org/10.1016/j.comgeo.2021.101784
https://doi.org/10.1016/j.comgeo.2021.101784
Autor:
Martin L. Demaine, Erik D. Demaine, Jin-ichi Itoh, Chie Nara, Zachary Abel, Jayson Lynch, Jason S. Ku
We prove that any finite polyhedral manifold in 3D can be continuously flattened into 2D while preserving intrinsic distances and avoiding crossings, answering a 19-year-old open problem, if we extend standard folding models to allow for countably in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bbf50bb6346e4a18a28e6ba1f46d3811