In this work we present an algorithm to perform algorithmic differentiation in the context of quantum computing. We two versions algorithm, one which is fully and employees a classical step (hybrid approach). Since implementation elementary functions already possible on computers, scheme that propose can be easily applied. Moreover, since some steps (such as CNOT operator) (or will be) faster c...

Abstract Pulsar timing is a process of iteratively fitting pulse arrival times to constrain the spindown, astrometric, and possibly binary parameters pulsar, by enforcing integer numbers pulsar rotations between times. Phase connection unambiguously determining those rotation while solution. currently requires manual step-by-step phase performed individuals. In an effort quantify streamline thi...

The Lovász Local Lemma is a powerful tool in combinatorics and computer science. The original version of the lemma was nonconstructive, and efficient algorithmic versions have been developed by Beck, Alon, Molloy & Reed, et al. In particular, the work of Molloy & Reed lets us automatically extract efficient versions of essentially any application of the symmetric version of the Local Lemma. How...

In the frame of the Austrian Grid Phase 2, we have designed and implemented an API for grid computing that can be used for developing grid-distributed parallel programs without leaving the level of the language in which the core application is written. Our software framework is able to utilize the information about heterogeneous grid environments in order to adapt the algorithmic structure of p...

In this paper, we present a novel visualization technique for assisting in observation and analysis of algorithmic complexity. In comparison with conventional line graphs, this new technique is not sensitive to the units of measurement, allowing multivariate data series of different physical qualities (e.g., time, space and energy) to be juxtaposed together conveniently and consistently. It sup...

In this paper, methods and concepts for algorithmic musical composition with flocking algorithms are discussed. Taking three pieces from an exhibition as examples, the strategies for building the specific relationships between each swarm-system and its musical results are shown. General considerations about the structures of self-organising systems and their potential for shaping musical dynami...

Recent theories of universal algorithmic intelligence, combined with the view that the world can be completely specified in mathematical terms, have led to claims about intelligence in any agent, including human beings. We discuss the validity of assumptions and claims made by theories of universally optimal intelligence in relation to their application in actual robots and intelligence tests. ...

Computer Science courses seek to hone students’ computational algorithmic thinking (CAT) capabilities. Oftentimes, students fail to recognize the connection between CAT in everyday life and its application in academic settings. One context in which people have a great deal of experience and expertise engaging in the design, implementation, and assessment of algorithms is food. This paper descri...