Show simple item record

Files in this item


Item metadata

dc.contributor.authorCameron, Peter Jephson
dc.contributor.authorFairbairn, Ben
dc.contributor.authorGadouleau, Maximilien
dc.identifier.citationCameron , P J , Fairbairn , B & Gadouleau , M 2014 , ' Computing in permutation groups without memory ' , Chicago Journal of Theoretical Computer science , vol. 2014 , 7 .
dc.identifier.otherPURE: 156946830
dc.identifier.otherPURE UUID: 71e2cfd6-3d30-411e-bfb6-aee1f5f6ab40
dc.identifier.otherORCID: /0000-0003-3130-9505/work/58055548
dc.descriptionFunding: UK Engineering and Physical Sciences Research Council (EP/K033956/1)en
dc.description.abstractMemoryless computation is a new technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically involve updates of single registers. The memoryless computation model can be fully expressed in terms of transformation semigroups, or in the case of bijective functions, permutation groups. In this paper, we consider how efficiently permutations can be computed without memory. We determine the minimum number of basic updates required to compute any permutation, or any even permutation. The small number of required instructions shows that very small instruction sets could be encoded on cores to perform memoryless computation. We then start looking at a possible compromise between the size of the instruction set and the length of the resulting programs. We consider updates only involving a limited number of registers. In particular, we show that binary instructions are not enough to compute all permutations without memory when the alphabet size is even. These results, though expressed as properties of special generating sets of the symmetric or alternating groups, provide guidelines on the implementation of memoryless computation.
dc.relation.ispartofChicago Journal of Theoretical Computer scienceen
dc.rights© 2014. Peter J. Cameron, Ben Fairbairn, and Maximilien Gadouleau. Licensed under a Creative Commons Attribution License (CC-BY).en
dc.subjectMemoryless computationen
dc.subjectPermutation groupsen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.titleComputing in permutation groups without memoryen
dc.typeJournal articleen
dc.description.versionPublisher PDFen
dc.contributor.institutionUniversity of St Andrews. Pure Mathematicsen
dc.contributor.institutionUniversity of St Andrews. Statisticsen
dc.contributor.institutionUniversity of St Andrews. Centre for Interdisciplinary Research in Computational Algebraen
dc.description.statusPeer revieweden

This item appears in the following Collection(s)

Show simple item record