Considering the effects and implications of changing only a single vote per machine.
1 The authors are undergraduates at Yale University. We thank the Faculty of Engineering and the Office of New Haven and State Affairs for hosting the Voting in an e-Democracy symposium and the Yale Undergraduate Debates on Technology and Society which prompted us to prepare this analysis. Abstract We examine the effects of a type of electoral fraud easily… (More)
To date, work on formalizing connectionist computation in a way that is at least Turing-complete has focused on recurrent architectures and developed equivalences to Turing machines or similar super-Turing models, which are of more theoretical than practical significance. 1 We instead develop connectionist computation within the framework of information… (More)
The aim of this work is to address the question of whether we can in principle design rational decision-making agents or artificial intelligences embedded in computable physics such that their decisions are optimal in reasonable mathematical senses. Recent developments in rare event probability estimation, recursive bayesian inference, neural networks, and… (More)