Andreas Weiermann

1. Predicatively unprovable termination of the Ackermannian Goodstein process
   2019/05/31 by Toshiyasu Arai, David Fernández–Duque, Arai, Toshiyasu +5 · 1 citation
   Computer Science · #Advanced Algebra and Logic #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #semigroups and automata theory
2. Minimal bad sequences are necessary for a uniform Kruskal theorem
   2020/01/17 by Anton Freund, Freund, Anton, Michael Rathjen +3 · 2 citations
   Computer Science · Mathematics · #03B30 #03F35 #05C05 #06A07 #68Q42 #Benford’s Law and Fraud Detection #Combinatorics (math.CO) #Computability, Logic, AI Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Logic (math.LO) #Logic in Computer Science (cs.LO) #semigroups and automata theory
3. Optimal Image Transport on Sparse Dictionaries
   2023/11/03 by Junqing Huang, Haihui Wang, Huang, Junqing +5 · 1 citation
   Computer Science · #Advanced Image Processing Techniques #Computer Vision and Pattern Recognition (cs.CV) #FOS: Computer and information sciences #Generative Adversarial Networks and Image Synthesis #Image Enhancement Techniques