ABSTRACT: A busy beaver is a Turing machine of N states which, given a blank tape, halts with an equal or higher number of printed symbols than all other machines of N states. Candidates for this class of Turing machine cannot realistically be run on a traditional simulator due to their high demands on memory and time. This paper describes some techniques that can be used to run these machines ...

We have performed photometric observations of nearly 7 million stars with 8 < V < 15 with the SuperWASP-North instrument from La Palma between 2004 May–September. Fields in the RA range 17–18 hr, yielding over 185,000 stars with sufficient quality data, have been searched for transits using a modified box least-squares (BLS) algorithm. We find a total of 58 initial transiting candidates which h...

In voting contexts, some new candidates may show up in the course of the process. In this case, we may want to determinewhich of the initial candidates are possiblewinners, given that a fixed number k of new candidates will be added. We give a computational study of this problem, focusing on scoring rules, and we provide a formal comparison with related problems such as control via adding candi...

Abstract This article uses Swedish register data to study the labour market experiences of radical right-wing candidates standing in local elections. We look at different measures economic insecurity (labour participation trajectories, experience unemployment social networks and relative growth number jobs for foreign-born workers vis-a-vis natives) examine whether they are predictors running S...

We develop a new method to identify YSOs from star-forming regions using the photometry data from Spitzer’s c2d Legacy Project. The aim is to obtain YSO lists as complete as possible for studying the statistical properties, such as Star Formation Rate (SFR) and lifetimes of YSOs in different evolutionary stages. The largest obstacle for identifying YSOs comes from background galaxies with simil...