Anthony Morphett

Linearisations and the Ershov hierarchy

SB Cooper, J Gay, CM Harris, KI Lee, A Morphett

Journal article  |  2018  |  Computability

A partial order is computably well founded if it does not computably embed a copy of ' ‰ ' -, the order type of the negative integ..

Subject design and factors affecting achievement in mathematics for biomedical science

Steven Carnie, Anthony Morphett

Journal article  |  2017  |  International Journal of Mathematical Education in Science and Technology

Reports such as Bio2010 emphasize the importance of integrating mathematical modelling skills into undergraduate biology and life ..

Perceptions of mathematics among undergraduate biomedicine students

A Morphett

Conference Proceedings  |  2017

An interactive statistical sampling activity with chocolate

S Gunn, A Morphett

Conference Proceedings  |  2017

To R or not to R – what should we be considering?

S Gunn, A Morphett

Conference Proceedings  |  2016

Applets to support reasoning about explained and unexplained variability

A Morphett, S Gunn

Conference Proceedings  |  2016

Developing interactive applets with GeoGebra: processes, technologies

A Morphett, S Gunn, R Maillardet

Conference Proceedings  |  2015

Prompt enumerations and relative randomness

A Morphett

Journal article  |  2012  |  Journal of Logic and Computation

The 'dynamic' property of prompt simplicity has become an influential and important concept in the study of the c.e. Turing degree..

Incompleteness, approximation and relative randomness

A Morphett

Journal article  |  2012  |  Computability

We present some results about the structure of c.e. and Δ02 LR-degrees. First we give a technique for lower cone avoidance in the ..

Non-cupping, measure and computably enumerable splittings

G Barmpalias, A Morphett

Journal article  |  2009  |  Mathematical Structures in Computer Science

We show that there is a computably enumerable function f (that is, computably approximable from below) that dominates almost all f..