#### Filter Results:

#### Publication Year

2002

2009

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

In this report I provide an introduction to the burgeoning field of hypercomputation – the study of machines that can compute more than Turing machines. I take an extensive survey of many of the key concepts in the field, tying together the disparate ideas and presenting them in a structure which allows comparisons of the many approaches and results. To… (More)

This paper surveys a wide range of proposed hypermachines, examining the resources that they require and the capabilities that they possess.

We show how to determine the k-th bit of Chaitin's algorithmically random real number, Ω, by solving k instances of the halting problem. From this we then reduce the problem of determining the k-th bit of Ω to determining whether a certain Diophantine equation with two parameters, k and N , has solutions for an odd or an even number of values of N. We also… (More)

- Toby Ord, Alan Blair
- 2002

– We present a new paradigm extending the Iterated Prisoner's Dilemma to multiple players. Our model is unique in granting players information about past interactions between all pairs of players – allowing for much more sophisticated social behaviour. We provide an overview of preliminary results and discuss the implications in terms of the evolutionary… (More)

It is often claimed that from the moment of conception embryos have the same moral status as adult humans. This claim plays a central role in many arguments against abortion, in vitro fertilization, and stem cell research. In what follows, I show that this claim leads directly to an unexpected and unwelcome conclusion: that natural embryo loss is one of the… (More)

- Toby Ord, Tien D. Kieu
- IJUC
- 2009

While it is well known that a Turing machine equipped with the ability to ip a fair coin cannot compute more that a standard Turing machine, we show that this is not true for a biased coin. Indeed, any oracle set X may be coded as a probability p X such that if a Turing machine is given a coin which lands heads with probability p X it can compute any… (More)

We show how to determine the k-th bit of Chaitin's algorithmically random real number Ω by solving k instances of the halting problem. From this we then reduce the problem of determining the k-th bit of Ω to determining whether a certain Diophantine equation with two parameters, k and N , has solutions for an odd or an even number of values of N. We also… (More)

- ‹
- 1
- ›