3 papers
math.LO2026
Computably totally disconnected locally compact groups
Alexander Melnikov, Andre Nies
We study totally disconnected, locally compact (t.d.l.c.) groups from an algorithmic perspective. We give various approaches to defining computable presentations of t.d.l.c.\ group…
cs.CY2026
Quantifying Perception-Based Student Success with Generative AI: An Exploratory Monte Carlo Simulation
Seyma Yaman Kayadibi
Generative artificial intelligence (GenAI) tools such as ChatGPT have attracted growing attention in higher education, particularly in relation to how students perceive their usefu…
math.LO2026
Characterising SJT reducibility
Noam Greenberg, Andre Nies, Dan Turetsky
SJT reducibility between sets is defined by if for each computable function that is unbounded and nondecreasing, there is an -bound…