AI Education: Birds of a Feather

Games are beautifully crafted microworlds that invite players to explore complex terrains that spring into existence from even simple rules. As AI educators, games can offer fun ways of teaching important concepts and techniques. Just as Martin Gardner employed games and puzzles to engage both amateurs and professionals in the pursuit of Mathematics, a well-chosen game or puzzle can provide a catalyst for AI learning and research. [excerpt

Programming with Algebraic Effects and Handlers

Eff is a programming language based on the algebraic approach to computational effects, in which effects are viewed as algebraic operations and effect handlers as homomorphisms from free algebras. Eff supports first-class effects and handlers through which we may easily define new computational effects, seamlessly combine existing ones, and handle them in novel ways. We give a denotational semantics of eff and discuss a prototype implementation based on it. Through examples we demonstrate how the standard effects are treated in eff, and how eff supports programming techniques that use various forms of delimited continuations, such as backtracking, breadth-first search, selection functionals, cooperative multi-threading, and others

HyperK\"ahler Potentials via Finite-Dimensional Quotients

It is known that nilpotent orbits in a complex simple Lie algebra admit hyperK\"ahler metrics with a single function that is a global potential for each of the K\"ahler structures (a hyperK\"ahler potential). In an earlier paper the authors showed that nilpotent orbits in classical Lie algebras can be constructed as finite-dimensional hyperK\"ahler quotient of a flat vector space. This paper uses that quotient construction to compute hyperK\"ahler potentials explicitly for orbits of elements with small Jordan blocks. It is seen that the K\"ahler potentials of Biquard and Gauduchon for SL(n)-orbits of elements with X^2=0, are in fact hyperK\"ahler potentials.Comment: 20 pages, LaTeX with AMS macro

AI Education Matters: Data Science and Machine Learning with Magic: The Gathering

In this column, we briefly describe a rich dataset with many opportunities for interesting data science and machine learning assignments and research projects, we take up a simple question, and we offer code illustrating use of the dataset in pursuit of answers to the question

Quantum rotor description of the Mott-insulator transition in the Bose-Hubbard model

We present the novel approach to the Bose-Hubbard model using the $\mathrm{U}(1)$ quantum rotor description. The effective action formalism allows us to formulate a problem in the phase only action and obtain an analytical formulas for the critical lines. We show that the nontrivial $\mathrm{U}(1)$ phase field configurations have an impact on the phase diagrams. The topological character of the quantum field is governed by terms of the integer charges - winding numbers. The comparison presented results to recently obtained quantum Monte Carlo numerical calculations suggests that the competition between quantum effects in strongly interacting boson systems is correctly captured by our model.Comment: accepted to PR

Polynomial Path Orders: A Maximal Model

This paper is concerned with the automated complexity analysis of term rewrite systems (TRSs for short) and the ramification of these in implicit computational complexity theory (ICC for short). We introduce a novel path order with multiset status, the polynomial path order POP*. Essentially relying on the principle of predicative recursion as proposed by Bellantoni and Cook, its distinct feature is the tight control of resources on compatible TRSs: The (innermost) runtime complexity of compatible TRSs is polynomially bounded. We have implemented the technique, as underpinned by our experimental evidence our approach to the automated runtime complexity analysis is not only feasible, but compared to existing methods incredibly fast. As an application in the context of ICC we provide an order-theoretic characterisation of the polytime computable functions. To be precise, the polytime computable functions are exactly the functions computable by an orthogonal constructor TRS compatible with POP*

System upgrade: realising the vision for UK education

A report summarising the findings of the TEL programme in the wider context of technology-enhanced learning and offering recommendations for future strategy in the area was launched on 13th June at the House of Lords to a group of policymakers, technologists and practitioners chaired by Lord Knight. The report – a major outcome of the programme – is written by TEL director Professor Richard Noss and a team of experts in various fields of technology-enhanced learning. The report features the programme’s 12 recommendations for using technology-enhanced learning to upgrade UK education

Explainable Software Bot Contributions: Case Study of Automated Bug Fixes

In a software project, esp. in open-source, a contribution is a valuable piece of work made to the project: writing code, reporting bugs, translating, improving documentation, creating graphics, etc. We are now at the beginning of an exciting era where software bots will make contributions that are of similar nature than those by humans. Dry contributions, with no explanation, are often ignored or rejected, because the contribution is not understandable per se, because they are not put into a larger context, because they are not grounded on idioms shared by the core community of developers. We have been operating a program repair bot called Repairnator for 2 years and noticed the problem of "dry patches": a patch that does not say which bug it fixes, or that does not explain the effects of the patch on the system. We envision program repair systems that produce an "explainable bug fix": an integrated package of at least 1) a patch, 2) its explanation in natural or controlled language, and 3) a highlight of the behavioral difference with examples. In this paper, we generalize and suggest that software bot contributions must explainable, that they must be put into the context of the global software development conversation