Zobrazeno 1 - 10
of 195
pro vyhledávání: '"Egri-Nagy A"'
We give a practical computer algebra implementation of the Covering Lemma for finite transformation semigroups. The lemma states that given a surjective relational morphism $(X,S)\twoheadrightarrow(Y,T)$, we can establish emulation by a cascade produ
Externí odkaz:
http://arxiv.org/abs/2404.11923
The cost of passing -- using deep learning AIs to expand our understanding of the ancient game of Go
Autor:
Egri-Nagy, Attila, Törmänen, Antti
AI engines utilizing deep learning neural networks provide excellent tools for analyzing traditional board games. Here we are interested in gaining new insights into the ancient game of Go. For that purpose, we need to define new numerical measures b
Externí odkaz:
http://arxiv.org/abs/2208.12643
Autor:
Egri-Nagy, Attila, Törmänen, Antti
The widespread availability of superhuman AI engines is changing how we play the ancient game of Go. The open-source software packages developed after the AlphaGo series shifted focus from producing strong playing entities to providing tools for anal
Externí odkaz:
http://arxiv.org/abs/2009.01606
Autor:
Bhatia, Sangeeta, Egri-Nagy, Attila, Serdoz, Stuart, Praeger, Cheryl E., Gebhardt, Volker, Francis, Andrew
Measuring the distance between two bacterial genomes under the inversion process is usually done by assuming all inversions to occur with equal probability. Recently, an approach to calculating inversion distance using group theory was introduced, an
Externí odkaz:
http://arxiv.org/abs/2008.05560
Autor:
Egri-Nagy, Attila
Philosophical thinking has a side effect: by aiming to find the essence of a diverse set of phenomena, it often makes it difficult to see the differences between them. This can be the case with Mathematics, Programming, Writing and Philosophy itself.
Externí odkaz:
http://arxiv.org/abs/1803.05998
Autor:
Egri-Nagy, Attila
Publikováno v:
Philosophies 2018, 3(2), 15 https://doi.org/10.3390/philosophies3020015
We argue that computation is an abstract algebraic concept, and a computer is a result of a morphism (a structure preserving map) from a finite universal semigroup.
Comment: 13 pages, final version will be published elsewhere
Comment: 13 pages, final version will be published elsewhere
Externí odkaz:
http://arxiv.org/abs/1712.09404
Autor:
Egri-Nagy, Attila
Being declarative means that we do computer programming on higher levels of abstraction. This vague definition identifies declarativeness with the act of ignoring details, but it is a special case of abstraction. The unspecified part is some computat
Externí odkaz:
http://arxiv.org/abs/1711.09197
Autor:
Egri-Nagy, Attila
What is computable with limited resources? How can we verify the correctness of computations? How to measure computational power with precision? Despite the immense scientific and engineering progress in computing, we still have only partial answers
Externí odkaz:
http://arxiv.org/abs/1610.05849
We present a search algorithm for constructing embeddings and deciding isomorphisms of semigroups, working with their multiplication tables. The algorithm is used for enumerating diagram semigroups up to isomorphism and for finding minimal degree rep
Externí odkaz:
http://arxiv.org/abs/1603.06204
Autor:
Serdoz, Stuart, Egri-Nagy, Attila, Sumner, Jeremy, Holland, Barbara R., Jarvis, Peter D., Tanaka, Mark M., Francis, Andrew R.
Accurate estimation of evolutionary distances between taxa is important for many phylogenetic reconstruction methods. In the case of bacteria, distances can be estimated using a range of different evolutionary models, from single nucleotide polymorph
Externí odkaz:
http://arxiv.org/abs/1602.03962