me.dm is part of the decentralized social network powered by Mastodon.
Ideas and information to deepen your understanding of the world. Run by the folks at Medium.

Administered by:

Server stats:

1.5K
active users

Learn more

#computerscience

26 posts22 participants5 posts today

#archive screwlisp.small-web.org/show/K
#programming #engineering #software #computerscience #history #interview
#lispyGopherClimate
screwlisp.small-web.org/show/K
@kentpitman unpublished essay reading and #live

Also Cross-Referencing Editor Facility Kent wrote at Open University in England one summer on the Zmacs/Zwei #emacs substrate.

Live chat in #lambdaMOO as always, and I will also be watching #emacsconf on #irc. Please do engage with Kent directly live (through my voice)

#pleaseBoost @hairylarry

Is Google search getting worse? Maybe what we want from it has changed
By Ellen Phiddian

Has the simple search become less useful in a world of low-information, SEO-optimised sites, and often faulty AI summaries? Are there better ways to navigate the web?

abc.net.au/news/science/2025-0

ABC News · Are Google and other search engines getting worse, or should we change how we look for information?By Ellen Phiddian

screwlisp.small-web.org/show/u
See the page - Interviewing @kentpitman Live in less than 23 hours about his writing of the CREF editor tagging/hyperlinking/answer-generating (kind of) in the 80s. Links to Kent's thread on the page.

The SDF Mastodon is down can cannot be expected to recover before the show. PLEASE boost this one for visibility, and Kent's thread (and add questions/comments to address there).

screwlisp.small-web.orgURGENT Kent Pitman Live Interview 23 Hours

People say it's a misconception that quantum computers can evaluate a function on all its possible inputs in parallel. But actually a lot of quantum algorithms do begin by applying a function to a superposition of all possible inputs. It's just that after that point you need to do some difficult linear algebra and you can't always extract the information you want.

In fact, you can define a lot of important complexity classes in this way. The set of problems solvable in polynomial time with an oracle that evaluates a given circuit on all its possible inputs and tells you …

P: … nothing.
BPP: … a randomly chosen output.
PP: … a majority output.
NP: … if any of the outputs is nonzero.
co-NP: … if all of the outputs are nonzero.
PSPACE: … a fixed point.