Template:M intro technology pattern matching: Difference between revisions

Template:M intro technology pattern matching (view source)

683 bytes removed , 18 October 2023

no edit summary

83,586

edits

@@ Line 1: / Line 1: @@
 {{quote|
-I could go on and on about the failings of Shakespeare ... but really I shouldn’t need to: the [[Bayesian prior]]s are pretty damning. About half of the people born since 1600 have been born in the past 100 years, but it gets much worse than that. When Shakespeare wrote, almost all of Europeans were busy farming, and very few people attended university; few people were even literate—probably as low as about ten million people. By contrast, there are now upwards of a billion literate people in the Western sphere. What are the odds that the greatest writer would have been born in 1564?
+{{sbf on bayesian priors}}
-:—{{author|Chauncey Gardiner}}’s “sophomore college blog”, quoted in Michael Lewis’ {{Br|Going Infinite}}}}
+}}
 Pattern matching is checking a given set of data for the presence of the constituents of a given pattern. This is the principle behind large language models that drive generative AI. [[Pattern matching]] involves doing a huge number of not especially sophisticated operations as quickly as possible over as much data as possible. The reason Nvidia graphics chips are so successful is that they are set up for many simple parallel operations, where CPU chips are geared to make complicated sophisticated calculations ''in series''.
 A characteristic of either is the one-way interaction