W. Patrick McCray on his book Readme

See README: A Bookish History of Computing from Electronic Brains to Everything Machines. 

11:29 on the dynamics of the knowledge industry, see Toby on How to Sell a Textbook. 

26:19 and 1:05:52 On Joseph Weizenbaum and his book Computer Power and Human Reason: From Judgment to Calculation. You can read it on the Internet Archive. 

29:57 On Ted Nelson's book Computer Lib/Dream Machines being republished by Microsoft Press. See Dream Machines on Bret Victor's web site. It's also on the Internet Archive. See, e.g. the chapter Beautiful Bunny Booties:

See also Alan Kay and Bonnie MacBird's Tribute to Ted Nelson. 

42:03 on the book Introduction to VLSI systems by Carver Mead and Lynn Conway. Apparently the DARPA-funded VLSI Project Mead–Conway VLSI chip design revolution was a thing. See Alan Kay on Simplicity. 

57:01 on computers as authors and 19th century algorithms for composing prose and poetry. 

Sometimes I think it's working, and that the world is changing for the better. This is one of them: People Inventing New Languages to Describe Sounds and Braids, Permutations, Representations, Continued Fraction Expansions and Models of Typed Lambda Calculus.

Subscribe to Computer History Museum. 

Comments

Post a Comment

Popular posts from this blog

How Could One Unify CMU and MIT

Image
I mean, how to get the best of the two different philosophies of computation. One is based on typed programming languages and the other on engineering with diagrams . This is about practical computing and the cost and feasibility of software development in general. Here is the problem: We have a lot of algorithms which can all be described abstractly using some sort of pseudocode, or perhaps using some particular language (usually Python!). These algorithms are often well-studied and a lot is known about them in terms of their computational complexity in time and space. Substantive practical software systems invariably employ many such algorithms, often implemented in libraries with more or less well-specified APIs. But very few of these libraries are capable of interoperating because they are either packages written in some specific programming language like Java or Haskell, say, or they are written in C and used as object code, or they are written in an interpreted language like Sc...
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

HTML in Blog Posts

Just testing stuff: SVG You can click on the blue circle: MathML There is not much you can do with this. See Mathematical Markup Language 1.01 Specification   7.1.5 Mixing and Linking MathML and HTML . It's the big problem  of how you compose languages.   a x 2 + b x + c = 0 You can click on the discriminant: x = − b ± b 2 − 4 ⁢ a ⁢ c 2 ⁢ a 2D Canvas Sound  Beep! WebGPU Next level Parser expression grammar compiler:  https://peggyjs.org/online.html Devine Lu Linvega's unxtal assembler/debugger:  https://wiki.xxi...
Read more