@javierg@mstdn.social avatar

javierg

@javierg@mstdn.social

think weird, crash hard

This profile is from a federated server and may be incomplete. For a complete list of posts, browse on the original instance.

javierg , to random
@javierg@mstdn.social avatar

"The fact that Microsoft produces such a consistent stream of garbage products and crooked business practices is an important testament to the way that a rotten organization can be so much less than the sum of its parts."

a great quote to hang on the wall! by @pluralistic , of course.

futurebird , to random
@futurebird@sauropods.win avatar

As a HS CS teacher I'm often torn when someone asks "do you do anything with AI with the kids?" not so much because of the controversies, but rather because nearly all projects I could plan would require using libraries of code without explaining how they work.

I feel the need to go from scratch to some degree. I know using libraries of part of coding, a worthy skill... but I have not been impressed with the cake mix lesson plans I've seen.

Has anyone seen anything that addresses this?

javierg ,
@javierg@mstdn.social avatar

@futurebird

Months ago, seeing the buzz about LLMs, I decided to show my kids (15 and 9 y/o así the time) about Markov chains.

Started from an empty window in Thony (the python editor) and a download of Don Quijote from the Gutenberg project. Half an hour later it was generating very Quixotic phrases.

The goal was teaching them how easy it is to make something "look"like it's thinking when it's only repeating patterns.

javierg ,
@javierg@mstdn.social avatar

@futurebird no, the fun was to show them how it worked by writing it slowly and shutting the results at each step.

In the end it was around 40 lines of readable python, easy to reproduce any time.

javierg ,
@javierg@mstdn.social avatar

@DamonWakes @futurebird

from random import randrange, choice def readfile(name): with open(name, encoding='utf-8') as f: t = f.read() return t def findall(base, s): l = [] p = -1 while True: p = base.find(s, p+1) if p < 0: break l.append(p) return l def try0(base): while True: p = randrange(0, len(base)) print(base[p], sep='', end='') def try1(base, n): p = randrange(0, len(base)-n) s = base[p: p+n] print(s, end='') while True: opts = findall(base, s) p = choice(opts) c = base[p+n] print(c, end='') s = s[1:]+c base = "abcdefghijklmnopqrstuvwxyz. " base = readfile('quijote.txt') try1(base, 5)
ALT
  • Reply
    • + futurebird
  • All
  • Subscribed
  • Moderated
  • Favorites
  • •
  • random
  • test
  • worldmews
  • mews
  • All magazines
    •