A comparison of multivariate normal generators

Three methods for generating outcomes on multivariate normal random vectors with a specified variance-covariance matrix are presented. A comparison is made to determine which method requires the least computer execution time and memory space when utilizing the IBM 360/67. All methods use as a basis a standard Gaussian random number generator. Results of the comparison indicate that the method based on triangular factorization of the covariance matrix generally requires less memory space and computer time than the other two metho

Demons, Deceivers And Liars: Newcomb’s Malin Génie

A fully adequate solution to Newcomb’s Problem (Nozick 1969) should reveal the source of its extraordinary elusiveness and persistent intractability. Recently, a few accounts have independently sought to meet this criterion of adequacy by exposing the underlying source of the problem’s profound puzzlement. Thus, Sorensen (1987), Slezak (1998), Priest (2002) and Maitzen and Wilson (2003) share the ‘no box’ view according to which the very idea that there is a right choice is misconceived since the problem is ill-formed or incoherent in some way. Among proponents of this view, Richard Jeffrey (2004) recently declared that he renounces his earlier position that accepted Newcomb problems as genuine decision problems. Significantly, Jeffrey suggests that “Newcomb problems are like Escher’s famous staircase on which an unbroken ascent takes you back where you startedâ€\x9D (Jeffrey (2004; 113)). Jeffrey’s analogy is apt for a puzzle whose specific logical features can be precisely articulated. Along the lines of these related approaches, I propose to improve and clarify them by providing such a deeper analysis that elucidates their essential, related insights. Copyright Springer 2006Descartes’s demon, decision theory, Newcomb’s problem, paradoxes of self-reference,