Rethinking the powers of truth commissions in light of the ICC statute

The Rome Statute of the International Criminal Court (ICC) is silent on the issue of national truth commissions. How the ICC might treat these bodies and the information they may hold is uncertain. The overlapping nature of the investigations likely to be carried out by the ICC and future truth-seeking bodies may, however, give rise to areas of tension, particularly where truth commissions hold confidential or self-incriminating information. This article questions whether the traditional truth-seeking powers to grant confidentiality and compel the provision of self-incriminating statements are compatible with the prosecutorial framework of the ICC. It considers how such information is likely to be dealt with by the ICC and analyses whether effective truth seeking can be carried out in the absence of such powers.

Error analysis of a Monte Carlo algorithm for computing bilinear forms of matrix powers

In this paper we present error analysis for a Monte Carlo algorithm for evaluating bilinear forms of matrix powers. An almost Optimal Monte Carlo (MAO) algorithm for solving this problem is formulated. Results for the structure of the probability error are presented and the construction of robust and interpolation Monte Carlo algorithms are discussed. Results are presented comparing the performance of the Monte Carlo algorithm with that of a corresponding deterministic algorithm. The two algorithms are tested on a well balanced matrix and then the effects of perturbing this matrix, by small and large amounts, is studied.

Comparison of the computational cost of a Monte Carlo and deterministic algorithm for computing bilinear forms of matrix powers

In this paper we consider bilinear forms of matrix polynomials and show that these polynomials can be used to construct solutions for the problems of solving systems of linear algebraic equations, matrix inversion and finding extremal eigenvalues. An almost Optimal Monte Carlo (MAO) algorithm for computing bilinear forms of matrix polynomials is presented. Results for the computational costs of a balanced algorithm for computing the bilinear form of a matrix power is presented, i.e., an algorithm for which probability and systematic errors are of the same order, and this is compared with the computational cost for a corresponding deterministic method.

Finality revived: powers and intentionality

Proponents of physical intentionality argue that the classic hallmarks of intentionality highlighted by Brentano are also found in purely physical powers. Critics worry that this idea is metaphysically obscure at best, and at worst leads to panpsychism or animism. I examine the debate in detail, finding both confusion and illumination in the physical intentionalist thesis. Analysing a number of the canonical features of intentionality, I show that they all point to one overarching phenomenon of which both the mental and the physical are kinds, namely finality. This is the finality of ‘final causes’, the long-discarded idea of universal action for an end to which recent proponents of physical intentionality are in fact pointing whether or not they realise it. I explain finality in terms of the concept of specific indifference, arguing that in the case of the mental, specific indifference is realised by the process of abstraction, which has no correlate in the case of physical powers. This analysis, I conclude, reveals both the strength and weakness of rational creatures such as us, as well as demystifying (albeit only partly) the way in which powers work.