Ausnahme gefangen: SSL certificate problem: certificate is not yet valid ๐Ÿ“Œ Donald Knuth's 2022 'Christmas Tree' Lecture Is About Trees

๐Ÿ  Team IT Security News

TSecurity.de ist eine Online-Plattform, die sich auf die Bereitstellung von Informationen,alle 15 Minuten neuste Nachrichten, Bildungsressourcen und Dienstleistungen rund um das Thema IT-Sicherheit spezialisiert hat.
Ob es sich um aktuelle Nachrichten, Fachartikel, Blogbeitrรคge, Webinare, Tutorials, oder Tipps & Tricks handelt, TSecurity.de bietet seinen Nutzern einen umfassenden รœberblick รผber die wichtigsten Aspekte der IT-Sicherheit in einer sich stรคndig verรคndernden digitalen Welt.

16.12.2023 - TIP: Wer den Cookie Consent Banner akzeptiert, kann z.B. von Englisch nach Deutsch รผbersetzen, erst Englisch auswรคhlen dann wieder Deutsch!

Google Android Playstore Download Button fรผr Team IT Security



๐Ÿ“š Donald Knuth's 2022 'Christmas Tree' Lecture Is About Trees


๐Ÿ’ก Newskategorie: IT Security Nachrichten
๐Ÿ”— Quelle: science.slashdot.org

Like a visit from an old friend, it's Donald Knuth's annual Christmas tree lecture for 2022. "Because of the pandemic, it's been three years since Knuth has been able to honor this tradition," notes The New Stack: 2022 marks the 60th anniversary of that fateful day in 1962 when a 24-year-old Donald Knuth started writing " The Art of Computer Programming." Now approaching his 85th birthday, Knuth has become almost a legend in the world of computer programming โ€” and he's still writing additional volumes for his massive analysis of algorithms. But every year, right around Christmas time, there's another tradition. Knuth gives a special lecture "pitched at non-specialists" for a small audience at Stanford University (where Knuth is a professor emeritus) and a larger audience online... Hunched over a notepad (which was projected onto a screen behind him), Knuth began the 26th annual Christmas lecture by pointing out that the evening's topic had been hiding in plain sight for two decades. For the first 20 years, they'd called them the "Christmas tree" lectures, since "trees are one of the most important things to a computer scientist. And every year I learned at least two new cool things about trees..." About five years ago they'd changed the name to just "Christmas lectures" โ€” but the problem wasn't that trees stopped being interesting. "I still learn cool things about trees every year. But they're getting harder and harder to explain to a general audience!" So this year's triumphant "homecoming" lecture would indeed include trees โ€” specifically a phenomenon Knuth describes as "twintrees," along with Baxter permutations, and Floorplans. Knuth noted they're all topics touched on in the latest volume of The Art of Computer Programming, before jokingly reminding the audience that his book makes an excellent Christmas present. By the end of the lecture, Knuth had written algorithms for all three mathematical concepts โ€” then connected all three algorithms with Linux pipes to show what happens when you convert one kind of sequence into the other and then into the other. "I get back, of course, the one I started with!"

Read more of this story at Slashdot.

...



๐Ÿ“Œ Donald Knuth's 2022 'Christmas Tree' Lecture Is About Trees


๐Ÿ“ˆ 105.98 Punkte

๐Ÿ“Œ Christmas Tree 1.1.2 - A little Christmas tree, counting down the days to Christmas on your desktop.


๐Ÿ“ˆ 64.66 Punkte

๐Ÿ“Œ If You Bought a Real Christmas Tree, You Paid 15 Cents To the Christmas Tree Promotion Board


๐Ÿ“ˆ 52.21 Punkte

๐Ÿ“Œ 30 Years of Donald Knuth's 'Christmas Lectures' Go Online - Including 2023's


๐Ÿ“ˆ 48.53 Punkte

๐Ÿ“Œ Just noticed the trees display a message in reverse: "Image Type: ARM Linux Kernel Image (lzo compressed)". In 2077 even the trees run Linux!


๐Ÿ“ˆ 36.44 Punkte

๐Ÿ“Œ Quantified Trees: How artificial intelligence can save city trees (EN)


๐Ÿ“ˆ 36.44 Punkte

๐Ÿ“Œ Quantified Trees: How artificial intelligence can save city trees (EN)


๐Ÿ“ˆ 36.44 Punkte

๐Ÿ“Œ Understanding AVL Trees in C#: A Guide to Self-Balancing Binary Search Trees


๐Ÿ“ˆ 36.44 Punkte

๐Ÿ“Œ Red-Black Trees in C#: A Guide to Efficient Self-Balancing Binary Search Trees


๐Ÿ“ˆ 36.44 Punkte

๐Ÿ“Œ Zahlen, bitte! Der hexadezimale Dollar von Donald E. Knuth


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Zahlen, bitte! Der hexadezimale Dollar von Donald E. Knuth


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Donald E. Knuth: Der Informatik-Papst wird 80


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Donald Knuth: Do what you really think is important


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Donald Knuth Turns 80, Seeks Problem-Solvers For TAOCP


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Donald Knuth: Do what you really think is important


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Donald Knuth: Algorithms, Complexity, Life, and The Art of Computer Programming | AI Podcast


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Donald Knuth: Alan Turing was the First 100% Geek | AI Podcast Clips


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Donald Knuth: Ant Colonies and Human Cognition | AI Podcast Clips


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Donald Knuth: Writing Process | AI Podcast Clips


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Donald Knuth: P=NP | AI Podcast Clips


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Donald E. Knuth: 30 Jahre Weihnachtsvorlesungen frei verfรผgbar


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ 81-Year-Old Donald Knuth Releases New TAOCP Book, Ready to Write Hexadecimal Reward Checks


๐Ÿ“ˆ 36.08 Punkte

๐Ÿ“Œ Microsoftโ€™s Emails Come with Gift Cards Hiding Behind the Christmas Trees


๐Ÿ“ˆ 30.67 Punkte

๐Ÿ“Œ 5 Best TV Christmas deals & After Christmas Sales [Dec 2022]


๐Ÿ“ˆ 27.5 Punkte

๐Ÿ“Œ Let's Tree-Shake It... (aka Demystifying Tree-Shaking and Dead Code Elimination)


๐Ÿ“ˆ 27.3 Punkte

๐Ÿ“Œ Medium CVE-2020-7682: Marked-tree project Marked-tree


๐Ÿ“ˆ 27.3 Punkte

๐Ÿ“Œ PE Tree - Python Module For Viewing Portable Executable (PE) Files In A Tree-View


๐Ÿ“ˆ 27.3 Punkte

๐Ÿ“Œ CTO (Call Tree Overviewer): yet another function call tree viewer


๐Ÿ“ˆ 27.3 Punkte

๐Ÿ“Œ Difference between Binary Search Tree and AVL Tree


๐Ÿ“ˆ 27.3 Punkte

๐Ÿ“Œ Abstract Syntax Tree vs Parse Tree


๐Ÿ“ˆ 27.3 Punkte

๐Ÿ“Œ Tree-Planting Schemes Are Just Creating Tree Cemeteries


๐Ÿ“ˆ 27.3 Punkte

๐Ÿ“Œ Constructing a Decision Tree Classifier: A Comprehensive Guide to Building Decision Tree Modelsโ€ฆ


๐Ÿ“ˆ 27.3 Punkte

๐Ÿ“Œ [623. Add One Row to Tree](https://leetcode.com/problems/add-one-row-to-tree/)


๐Ÿ“ˆ 27.3 Punkte

๐Ÿ“Œ Cayla doll too eavesdroppy to put under the Christmas tree, says France


๐Ÿ“ˆ 26.1 Punkte











matomo