Daniel Tubbenhauer on An Unknotter

See Unknotting number is not additive under connected sum by Mark Brittenham and Susan Hermiller and A remark on the counterexample to the unknotting number conjecture by Chao Wang and Yimu Zhang. 

My comment:

That was great fun to see! What your pipeline is doing is constructing some sort of lattice-like structure, isn't it? It's surprising (to me anyway!) how often implausible-looking fixpoints can actually be constructed. Yesterday I heard about Fully Homomorphic Encryption, I think it's called. There's a paper called "Fully homomorphic encryption using ideal lattices". Your idea of using heuristic RL steps in the process of building the actual lattice is new though. It might generalise to a lot of other lattices. I hope Terrence Tao gets to hear about this!

I think this is hard for essentially the same reason that the busy beaver numbers are not computable. I was thinking about this when I watched his latest lecture on the difference between braids and links. 

But sometimes you can find fixpoints. For example see Fully homomorphic encryption using ideal lattices. 

Subscribe to Daniel Tubbenhauer. 

Subscribe to Stand Up Maths. 

Mathematical methods and human thought in the age of AI: 

Subscribe to SAIR. 

Comments

Post a Comment

Popular posts from this blog

Steven Johnson - So You Think You Know How to Take Derivatives?

Image
A derivative is linearisation, and differential calculus is essentially linear algebra, ...  See  Freya Holmér - Why Can't You Multiply Vectors?  and  Freya Holmér on Continuity of Splines . See also the MIT OCW page:  Matrix Calculus For Machine Learning And Beyond  (Alan Edelman, Steven G. Johnson) Subscribe to The Julia Programming Language . Alan Edelman talking about expressing mathematics as computer code. The idea is that you can use computer languages to communicate mathematical ideas precisely to other people. See my comments about functional programming languages here:  https://prooftoys.org/ian-grant/hm/ Subscribe to TEDx Talks .
Read more

Tensor Fields and Simplicial Complexes

Image
Listening to Freya Holmér last night I started to get glimmers of an idea I had long ago about how to represent vector spaces in computational processes using this recursive abstract type :  abstype 'a point = POINT   of {getx :  'a vector,       diff :  'a point -> 'a point,       move :  'a point -> 'a point,       scale : 'a -> 'a point,       proj :  'a point -> 'a} with    fun new i (op +) (op -) (op * ) dot =    let fun self x =  POINT       {getx = x,        move = fn (POINT pr) =>           (self (x + (#getx pr))),        diff = fn (POINT pr) =>          self (x - (#getx pr)),        scale = fn i =>          (self (x * i)),        proj = fn (POINT pr) =>     ...
Read more

FUTO FUBS

Image
I think this is the first time they've actually publicly announced anything about this project. See these posts: Eron Woolf on Why Open Source is Failing Matt Mikhailov and Vincent McKibbon on The Problem with Open Hardware Jason Kridner talking About BeagleBoard.org and Software Development .  See these places:  https://danielc.dev/rk/ https://github.com/petabyt/rk https://github.com/futo-org/ret See also  https://pine64.org/devices/pinebook_pro/ . Subscribe to  FUTO .  See  https://github.com/nir9/low-level-learning-resources/tree/master/setups/debian . Subscribe to  Nir Lichtman .  If you're looking for a cool init process, try  https://ctx.graphics/terminal/ . See  Artful Bytes - When to Use a RTOS  and  How to Create a Successful Open Source Project . 
Read more