There is a long history of the science of intelligent machines and its potential to provide scientific insights have been debated since the dawn of AI. In particular, there is renewed interest in the role of AI in research and research policy as an enabler of new methods, processes, management and evaluation which is still relatively under-explored. This empirical paper explores interviews with leading scholars on the potential impact of AI on research practice and culture through deductive, thematic analysis to (...) show the issues affecting academics and universities today. Our interviewees identify positive and negative consequences for research and researchers with respect to _collective_ and _individual use_. AI is perceived as helpful with respect to information gathering and other narrow tasks, and in support of impact and interdisciplinarity. However, using AI as a way of ‘speeding up—to keep up’ with bureaucratic and metricised processes, may proliferate negative aspects of academic culture in that the expansion of AI in research should assist and not replace human creativity. Research into the future role of AI in the research process needs to go further to address these challenges, and ask fundamental questions about how AI might assist in providing new tools able to question the values and principles driving institutions and research processes. We argue that to do this an explicit movement of meta-research on the role of AI in research should consider the effects for research and researcher creativity. Anticipatory approaches and engagement of diverse and critical voices at policy level and across disciplines should also be considered. (shrink)

Contemporary epistemologists of education have raised concerns about the distorting effects of some of the processes and structures of contemporary academia on the epistemic practice and character of academic researchers. Such concerns have been articulated using the concept of epistemic corruption. In this paper, we lend credibility to these theoretically-motivated concerns using the example of the research impact agenda during the period 2012-2014. Interview data from UK and Australian academics confirms the impact agenda system, at its inception, facilitated the development (...) and exercise of epistemic vices. As well as vindicating theoretically-motivated claims about epistemic corruption, inclusion of empirical methods and material can help us put the concept to work in ongoing critical scrutiny of evolving forms of the research impact agenda. (shrink)

We examine the reverse mathematics and computability theory of a form of Ramsey's theorem in which the linear n-tuples of a binary tree are colored.

We establish that for every computably enumerable (c.e.) Turing degree b the upper cone of c.e. Turing degrees determined by b is the degree spectrum of the successor relation of some computable linear ordering. This follows from our main result, that for a large class of linear orderings the degree spectrum of the successor relation is closed upward in the c.e. Turing degrees.

We study the weak truth-table and truth-table degrees of the images of subsets of computable structures under isomorphisms between computable structures. In particular, we show that there is a low c.e. set that is not weak truth-table reducible to any initial segment of any scattered computable linear ordering. Countable $\Pi _{1}^{0}$ subsets of 2ω and Kolmogorov complexity play a major role in the proof.

Stories are an important indicator of our vision of the future. In the case of artificial intelligence, dominant stories are polarized between notions of threat and myopic solutionism. The central storytellers—big tech, popular media, and authors of science fiction—represent particular demographics and motivations. Many stories, and storytellers, are missing. This paper details the accounts of missing AI narratives by leading scholars from a range of disciplines interested in AI Futures. Participants focused on the gaps between dominant narratives and the untold (...) stories of the capabilities, issues, and everyday realities of the technology. One participant proposed a “story crisis” in which these narratives compete to shape the public discourse on AI. Our findings indicate that dominant narratives distract and mislead public understandings and conceptions of AI. This suggests a need to pay closer attention to missing AI narratives. It is not simply about telling new stories, it is about listening to existing stories and asking what is wanted from AI. We call for realistic, nuanced, and inclusive stories, working with and for diverse voices, which consider story-teller; genre, and communicative purpose. Such stories can then inspire the next generation of thinkers, technologists, and storytellers. (shrink)

We consider whether given a simple, finite description of a group in the form of an algorithm, it is possible to algorithmically determine if the corresponding group has some specified property or not. When there is such an algorithm, we say the property is recursively recognizable within some class of descriptions. When there is not, we ask how difficult it is to detect the property in an algorithmic sense. We consider descriptions of two sorts: first, recursive presentations in terms of (...) generators and relators, and second, algorithms for computing the group operation. For both classes of descriptions, we show that a large class of natural algebraic properties, Markov properties, are not recursively recognizable, indeed they are \-hard to detect in recursively presented groups and \-hard to detect in computable groups. These theorems suffice to give a sharp complexity measure for the detection problem of a number of typical group properties, for example, being abelian, torsion-free, orderable. Some properties, like being cyclic, nilpotent, or solvable, are much harder to detect, and we give sharp characterizations of the corresponding detection problems from a number of them. We give special attention to orderability properties, as this was a main motivation at the beginning of this project. (shrink)

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {A}$$\end{document} of a computably enumerable, model complete theory, the entire elementary diagram E\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E$$\end{document} must be decidable. We prove that indeed a c.e. theory T is model complete if and only if there is a (...) uniform procedure that succeeds in deciding E\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$E$$\end{document} from the atomic diagram Δ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varDelta $$\end{document} for all countable models A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {A}$$\end{document} of T. Moreover, if every presentation of a single isomorphism type A\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathcal {A}$$\end{document} has this property of relative decidability, then there must be a procedure with succeeds uniformly for all presentations of an expansion \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$$$\end{document} by finitely many new constants. (shrink)

We study the relationship between algebraic structures and their inverse semigroups of partial automorphisms. We consider a variety of classes of natural structures including equivalence structures, orderings, Boolean algebras, and relatively complemented distributive lattices. For certain subsemigroups of these inverse semigroups, isomorphism of the subsemigroups yields isomorphism of the underlying structures. We also prove that for some classes of computable structures, we can reconstruct a computable structure, up to computable isomorphism, from the isomorphism type of its inverse semigroup of computable (...) partial automorphisms. (shrink)