Happy Birthday Raymond Solomonoff

He was born July 25, 1926, a few days after Max Born sent his paper Zur Quantenmechanik der Stoßvorgänge for publication in the journal Zeitschrift für Physik.

37:53 To my shame I never bothered to look up the proof of why Ackermann-Péter function A(m,n) is not Primitive Recursive. I guessed it would be something complicated arguing about how A is implicit in the recursion parameter, i.e. that you need higher-order primitive recursion to represent function exponentiation f^(A(m,n)) meaning the function f applied A(m,n) times, ... but it uses an argument about the size of the partial sums of successive terms, ....  See PlanetMath: Ackermann function is not primitive recursive. See also this ProofWiki proof which is the same. More interesting is Larry Paulson's Ackermann's Function in Iterative Form: A Proof Assistant Experiment which he wrote whilst I was living in Chiapas, Mexico, begging at the traffic lights for my bus fare to Tijuana.

1:05:06 See this 2002 preprint Optimal Ordered Problem Solver by Juergen Schmidhuber, published in Machine Learning in March 2004. This is applied to Partial Predictive Matching and Grammatical Discovery (55:11) to generate distributions for searching problem spaces. He elaborates some more at 1:16:58. Daniel Tubbenhauer is using techniques like this to find unknotting numbers. See Daniel Tubbenhauer on An Unknotter.

1:29:09 On using specific models of computing to represent certain types of problem. I wonder if he knew about Post's work? See my post on Emil L. Post.

He still has a website! https://raysolomonoff.com/ See also The Meeting of the Minds That Launched AI > There’s more to this group photo from a 1956 AI workshop than you’d think.

Belated Happy 100th Birthday Ray! See Born's rule from epistemic assumptions by Per Östborn for some applications of Ray's idea.

It's just staggering how badly academia serves human knowledge, ... Jesus Christ! 

Subscribe to  Adrian German.

Comments

Post a Comment

Popular posts from this blog

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

Global Virtual Four Season School in The Foundations of Mathematics and Physics

Image
This is happening everywhere, all year around, just because of the nature of actual Human Knowledge. Invited speakers: a bunch of people who all know what they're talking about . On light and the nature of photographic process: Silver halide crystals only go off when exposed to light at certain frequencies, so the crystals have to be embedded in a glycerine matrix with layers of dye to make the film respond to visible light. Subscribe to  Smarter Every Day 2 . See  Joel Hamkins interviewed on About Logic .
Read more