eupolicy.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
This Mastodon server is a friendly and respectful discussion space for people working in areas related to EU policy. When you request to create an account, please tell us something about you.

Server stats:

192
active users

#computerscience

6 posts6 participants0 posts today

**”My AI is Lying to Me”: User-reported LLM hallucinations in AI mobile apps reviews**

"_The estimated prevalence of user-reported LLM hallucinations (RQ1) at 1.75% of AI-error-related reviews, while seemingly modest, represents a high-impact, low-frequency type of error that significantly erodes user trust. For product managers and QA leads, this signals that while hallucinations may not be the most common complaint, their presence is a critical indicator of deep model failure._"

Massenon, R., Gambo, I., Khan, J.A. et al. ”My AI is Lying to Me”: User-reported LLM hallucinations in AI mobile apps reviews. Sci Rep 15, 30397 (2025). doi.org/10.1038/s41598-025-154.

#OpenAccess #OA #Article #ComputerScience #AI #ArtificialIntelligence #Hallucinations LLMS #Technology #Tech #Academia

My paper "Continuous and algebraic domains in univalent foundations" with @MartinEscardo was accepted for publication by the Journal of Pure and Applied Algebra! 🎉
arxiv.org/abs/2407.06956

This paper has its origin in my very first paper with Martín (and my second paper overall) "Domain Theory in Constructive and Predicative Univalent Foundations" which appeared at Computer Science Logic (CSL) back in 2021.

Since then I wrote my PhD thesis on this topic (and worked on other things in type theory after) and the present paper is a revision of both the CLS'21 paper and my PhD thesis (which I completed in 2022).

Everything in the paper has been formalized and an HTML rendering of the Agda file that directly links the code to the paper can be found here: cs.bham.ac.uk/~mhe/TypeTopolog

arXiv logo
arXiv.orgContinuous and algebraic domains in univalent foundationsWe develop the theory of continuous and algebraic domains in constructive and predicative univalent foundations, building upon our earlier work on basic domain theory in this setting. That we work predicatively means that we do not assume Voevodsky's propositional resizing axioms. Our work is constructive in the sense that we do not rely on excluded middle or the axiom of (countable) choice. To deal with size issues and give a predicatively suitable definition of continuity of a dcpo, we follow Johnstone and Joyal's work on continuous categories. Adhering to the univalent perspective, we explicitly distinguish between data and property. To ensure that being continuous is a property of a dcpo, we turn to the propositional truncation, although we explain that some care is needed to avoid needing the axiom of choice. We also adapt the notion of a domain-theoretic basis to the predicative setting by imposing suitable smallness conditions, analogous to the categorical concept of an accessible category. All our running examples of continuous dcpos are then actually examples of dcpos with small bases which we show to be well behaved predicatively. In particular, such dcpos are exactly those presented by small ideals. As an application of the theory, we show that Scott's $D_\infty$ model of the untyped $λ$-calculus is an example of an algebraic dcpo with a small basis. Our work is formalised in the Agda proof assistant and its ability to infer universe levels has been invaluable for our purposes.

Voice actors are already losing work to an AI disruption expected to reach everything
By Romy Stephens

The Productivity Commission says artificial intelligence could offer a $116 billion shot in the arm to Australia's economy. But for people like voice actor Colin Cassidy, that means a disruption to their daily work.

abc.net.au/news/2025-08-15/how

ABC News · AI could be the government's productivity answer. But getting there will mean more disruptionBy Romy Stephens

Sometimes the Truth hurts. I just saw emacs referred to as the editor “Exclusively used by Middle Age Computer Scientists”.

Yeah, well, it still is the Text Editor of the Gods.

And I got my second job predominantly because I was an “emacs weenie from William and Mary”. Apparently we’re thought of fondly in some circles.

#AI #AlanTuring #TuringInstitute #Turing #Computing #ArtificialIntelligence #UK #Technology #ComputerScience #Science
It’s quite ironic that an organisation established in commemoration of one of our greatest geniuses may fail because its leaders appear to be too incompetent to run it…

Staff fear UK's Turing AI Institute at risk of collapse bbc.com/news/articles/c24zz2vd

British Secretary of State for Science, Innovation and Technology Peter Kyle departs a cabinet meeting at Downing Street in London. He has short, sharp grey hair and is wearing a smart suit.
www.bbc.comStaff fear UK's Turing AI Institute at risk of collapseA complaint raises concerns about the funding risks and a "toxic" culture at the Alan Turing Institute.

The new algorithm for directed cheapest routes "slices the graph into layers, moving outward from the source like Dijkstra’s. But rather than deal with the whole frontier at each step, it uses the Bellman-Ford algorithm to pinpoint influential nodes, moves forward from these nodes to find the shortest paths to others, and later comes back to other frontier nodes. It doesn’t always find the nodes within each layer in order of increasing distance, so the sorting barrier doesn’t apply. And if you chop up the graph in the right way, it runs slightly faster than the best version of Dijkstra’s algorithm. It’s considerably more intricate, relying on many pieces that need to fit together just right. But curiously, none of the pieces use fancy mathematics."

quantamagazine.org/new-method-

Quanta Magazine · New Method Is the Fastest Way To Find the Best Routes | Quanta MagazineA canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.