University of Oxford

There have been two main attempts so far to forecast the level of development of artificial intelligence (or ‘computerisation’) over time, Frey and Osborne (2013, 2017) and Manyika et al (2017). Unfortunately, their methodology seems to be flawed. Their results depend upon expert predictions of which occupations will be automatable in 2050, but these predictions are notoriously unreliable. Therefore, we develop an alternative which does not depend upon these expert predictions. We build a dataset of all the start-ups, firms, and university research laboratories working on automating different types of tasks, and use this to build a dynamic network model of them and how they interact. How automatable each type of task is ‘emerges’ from the model. We validate it, predicting the level of development of supervised learning in 2017 using data from the year 2000, and use it to forecast of the automatability of each of these task types from 2018 to 2050. Finally, we discuss extensions for our model; how it could be used to test the impact of public policy decisions or forecast developments in other high-technology industries.

In this talk we will introduce quantifier elimination and give various examples of theories with this property. We will see some very useful applications of quantifier elimination to algebra and geometry that will hopefully convince you how practical this property is to other areas of mathematics.

We continue the study by Melo and Winter [arXiv:1712.01763, 2017] on the possible intersection sizes of a $k$-dimensional subspace with the vertices of the $n$-dimensional hypercube in Euclidean space. Melo and Winter conjectured that all intersection sizes larger than $2^{k-1}$ (the “large” sizes) are of the form $2^{k-1} + 2^i$. We show that this is almost true: the large intersection sizes are either of this form or of the form $35\cdot2^{k-6}$ . We also disprove a second conjecture of Melo and Winter by proving that a positive fraction of the “small” values is missing.

In this talk, we shall introduce various identities among partitions of integers, and how these can be expressed via formal power series. In particular, we shall look at the Rogers Ramanujan identities of power series, and discuss possible combinatorial proofs using partitions and Durfree squares.

Graphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods, each of which highlights the properties of graphs in a unique way. I will discuss a novel approach to study graphs: the simplex geometry (a simplex is a generalized triangle). This perspective, proposed by Miroslav Fiedler, introduces techniques from (simplex) geometry into the field of graph theory and conversely, via an exact correspondence. We introduce the graph-simplex correspondence, identify a number of basic connections between graph characteristics and simplex properties, and suggest some applications as example.

Reference: https://arxiv.org/abs/1807.06475
 

In this talk I will introduce Hilbert's 10th Problem (H10) and the model-theoretic notions necessary to explore this problem from the perspective of mathematical logic. I will give a brief history of its proof, talk a little about its connection to decidability and definability, then close by speaking about generalisations of H10 - what has been proven and what has yet to be discovered.

An informal session for DPhil students, ECRs and undergraduates with an interest in probability. The aim is to gain exposure to areas outside of your own research interests in an informal and accessible way.

An informal session for DPhil students, ECRs and undergraduates with an interest in probability. The aim is to gain exposure to areas outside of your own research interests in an informal and accessible way.

An informal session for DPhil students, ECRs and undergraduates with an interest in probability. The aim is to gain exposure to areas outside of your own research interests in an informal and accessible way.

An informal session for DPhil students, ECRs and undergraduates with an interest in probability. The aim is to gain exposure to areas outside of your own research interests in an informal and accessible way.