Impredicativity, Computation and Sheafification

See the full interview here: About Logic with Andrej Bauer and this discussion at 40:14.

You can support Deniz by helping with production costs via https://buymeacoffee.com/aboutlogic.

My comment:

The good old completeness theorem is my favourite theorem! Can you  and Thorsten interview Paul Taylor some time and ask him why they wrote Proofs and Types in such a bizarre way. Was it to drive people insane if they were stupid enough to try to understand logic and computation?

Subscribe to About Logic.


My comment:

I am wondering whether I am the only person in this subset of people who understand some part of this video, ...

Subscribe to Sheafification of G. 

See Dana Scott's Stochastic Lambda Calculus: an Extended Abstract and Lattices Everywhere.

This whole way of doing topos theory just doesn't seem right to me. If it's all based on constructive mathematics then why can't it all be described in one language? These people keep inventing new languages and the whole thing starts to look a bit inflated. But I guess people have to get PhDs for something, right?

Subscribe to Topos Institute. 

See Richard Southwell Being Norman Wildberger and David Jaz Maiers - Compositionality via 2-algebra.

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