#turingmachine — Public Fediverse posts

🚀 "Unicode can run a Turing machine"—because apparently, translating your emoji 🐍 to Klingon requires the computational power of Skynet. 🤖🔍 The pinnacle of computer science now involves linguistic acrobatics and a Ph.D. in #Unicode arcana. 📚💥
https://seriot.ch/computation/uts35/ #TuringMachine #EmojiSkynet #Linguistics #ComputerScience #HackerNews #ngated

🚀 "Unicode can run a Turing machine"—because apparently, translating your emoji 🐍 to Klingon requires the computational power of Skynet. 🤖🔍 The pinnacle of computer science now involves linguistic acrobatics and a Ph.D. in #Unicode arcana. 📚💥
https://seriot.ch/computation/uts35/ #TuringMachine #EmojiSkynet #Linguistics #ComputerScience #HackerNews #ngated

“Things that are so far removed from our daily experience… are inherently hard to understand”*…

That’s certainly true of numbers. And as the numbers grow, the cognitive challenges grow with them. (Indeed, by way of example: 1 million seconds, is roughly 11.5 days; 1 billion seconds is almost 32 years.)

We’ve looked before at the mysterious extremes of math: zero and infinity [and here]. But as Dan Falk reminds us, the numbers in between can seem pretty strange as well– especially the extremely large ones. In a review of Richard Elwes‘ Huge Numbers: A Story of Counting Ambitiously, From 4½ to Fish 7, Falk spotlights some of the largest numbers humans have ever contemplated…

… Aficionados of huge numbers are called “googologists,” a reference to the number 10100, known as a googol. Such numbers have a peculiar sort of existence. For the vast majority of us, they’re of limited everyday value. Calculations at the supermarket checkout, or at tax time in April, typically involve far more modest figures. Perhaps we’ve read that the U.S. national debt is in excess of $38 trillion — a mind-numbing figure, to be sure, but it’s not as though any one individual needs to count it up in stacks of $20 bills.

And yet, much larger numbers await those who seek them out. Consider the kinds of numbers that crop up in problems involving combinations and permutations. For example, in how many distinct ways can one shuffle a deck of cards? Elwes takes us through the calculation, and we end up with a figure of about 8×1067. Compared to that number, the odds of getting a royal flush when dealt a five-card poker hand seem pretty decent, sitting at a mere 1 in 649,740 (still rare enough that many poker players have never held such a hand). Or consider that famous 1980s cultural touchstone, the Rubik’s cube. In how many ways can one scramble the cube? It turns out that the figure is about 43 quintillion, or 4.3×1019 — but in spite of that ridiculously large figure, people do routinely solve the puzzle, and champions can do it in mere seconds. In fact, as Elwes explains, no Rubik’s cube arrangement is more than 20 moves away from any other arrangement.

Or consider the age of the universe, estimated to be about 13.8 billion years. This may seem like a lengthy span of time, but our cosmic future is where the really big numbers come up. Elwes examines the so-called heat death of the universe, in which all matter has broken down into subatomic particles. We may reach this point in [10 raised to the 10th power, raised again to the 120th power] years — this dizzying figure is 10 raised to the power of 10120 — at which point, Elwes says, the universe will have ballooned up to a diameter of 10 to the power of 10 to the power of 10120 light years. (Yes, that’s [10 raised to the 10th power, again to the 10th power, then to the 120th power] light years.) Elwes adds a footnote: “At this point, the choice of units hardly matters; the distance is so immense that whether we choose to measure it in Planck lengths or giga-light years makes little difference.” Let that sink in!

As mind numbing as such figures are, the highest numbers contemplated by humans come not from physics but from pure mathematics and computer science. Like “Graham’s number” — an immense figure put forward as the upper-bound for solutions to a problem in a branch of mathematics known as Ramsey theory. Some readers may find the ensuing discussion of multi-dimensional hypercubes a bit challenging, but one can enjoy the payoff regardless: We end up with a number that can’t even be expressed in conventional notation, and which earned a mention in the 1980 edition of the “Guinness Book of World Records” as “the highest number ever used in a mathematical proof.”

Reading this book is a little bit like sitting in the back row of an auction house where a rare Picasso (let’s say) is up for grabs: How high is this thing going to go? And indeed, Elwes keeps going. We eventually meet the so-called busy beaver numbers, a set of numbers that crop up in theoretical computer science, when one tries to deduce whether a particular computer program will eventually stop, or keep going forever — a conundrum known as the “halting problem.” As Elwes explains, it’s not at all straightforward to distinguish the two types of programs (and if it was, it would help mathematicians tackle some of the most vexing problems in their field).

The fifth busy beaver number, known as BB(5) — associated with a computer program that can access five internal states — works out to 47,176,870. And that’s as far as we’ve gotten, Elwes explains. No one has worked out the value of BB(6), but he assures us that it’s beyond the range of any physical computer; and BB(16) leaves even Graham’s number in the dust.

But wait, there’s more! “Rayo’s number,” concocted by Agustín Rayo — a dean and professor at MIT — using set theory, is bigger still (here’s a fun video about it); and “Fish 7,” mentioned in the book’s subtitle, named for a Japanese googologist who goes by the pseudonym “Fish,” builds on Rayo’s number, and … well, the details are not easily digested, but the mind-melting nature of these numbers comes across as a feature, not a bug, of Elwes’s story… the narrative is enlivened by explorations of the peculiarities of math history…

… Archimedes tried to estimate how many grains of sand would be needed to fill up the known universe, back in the third century B.C. Did he simply have too much time on his hands? Not at all, insists Elwes: The Greek thinker was articulating an important idea — that no matter how unfathomably large a quantity may be, we can describe it with precision, thanks to mathematics. “Archimedes,” he writes, “was penning a manifesto for the expressive power of large numbers.”…

… [Elwes focuses] on numbers that are ridiculously large and yet finite. In the end, perhaps this is the most mind-boggling fact of all: that these enormous numbers, from Graham’s number to Fish 7 and beyond, fall as far short of infinity as does the humble number 1…

The mysteries of the massive: “The Mind-Boggling Science of Enormous Numbers,” @danfalk.bsky.social on @richardelwes.bsky.social in @undark.org.

* Steven Strogatz

###

As we enumerate enormity, we might spare a thought for a seminal mathematician, Alan Turing; he died on this date in 1954. He was a foundational computer science pioneer (inventor of the Turing Machine (an influential model for the general-purpose computer), creator of the “Turing Test” (only too relevant in these AI-infected times), inspiration for “The Turing Award” (the “Nobel Prize of computing“), and cryptographer (leading member of the team that cracked the Enigma code during WWII).  

source

“Things that are so far removed from our daily experience… are inherently hard to understand”*…

That’s certainly true of numbers. And as the numbers grow, the cognitive challenges grow with them. (Indeed, by way of example: 1 million seconds, is roughly 11.5 days; 1 billion seconds is almost 32 years.)

We’ve looked before at the mysterious extremes of math: zero and infinity [and here]. But as Dan Falk reminds us, the numbers in between can seem pretty strange as well– especially the extremely large ones. In a review of Richard Elwes‘ Huge Numbers: A Story of Counting Ambitiously, From 4½ to Fish 7, Falk spotlights some of the largest numbers humans have ever contemplated…

… Aficionados of huge numbers are called “googologists,” a reference to the number 10100, known as a googol. Such numbers have a peculiar sort of existence. For the vast majority of us, they’re of limited everyday value. Calculations at the supermarket checkout, or at tax time in April, typically involve far more modest figures. Perhaps we’ve read that the U.S. national debt is in excess of $38 trillion — a mind-numbing figure, to be sure, but it’s not as though any one individual needs to count it up in stacks of $20 bills.

And yet, much larger numbers await those who seek them out. Consider the kinds of numbers that crop up in problems involving combinations and permutations. For example, in how many distinct ways can one shuffle a deck of cards? Elwes takes us through the calculation, and we end up with a figure of about 8×1067. Compared to that number, the odds of getting a royal flush when dealt a five-card poker hand seem pretty decent, sitting at a mere 1 in 649,740 (still rare enough that many poker players have never held such a hand). Or consider that famous 1980s cultural touchstone, the Rubik’s cube. In how many ways can one scramble the cube? It turns out that the figure is about 43 quintillion, or 4.3×1019 — but in spite of that ridiculously large figure, people do routinely solve the puzzle, and champions can do it in mere seconds. In fact, as Elwes explains, no Rubik’s cube arrangement is more than 20 moves away from any other arrangement.

Or consider the age of the universe, estimated to be about 13.8 billion years. This may seem like a lengthy span of time, but our cosmic future is where the really big numbers come up. Elwes examines the so-called heat death of the universe, in which all matter has broken down into subatomic particles. We may reach this point in [10 raised to the 10th power, raised again to the 120th power] years — this dizzying figure is 10 raised to the power of 10120 — at which point, Elwes says, the universe will have ballooned up to a diameter of 10 to the power of 10 to the power of 10120 light years. (Yes, that’s [10 raised to the 10th power, again to the 10th power, then to the 120th power] light years.) Elwes adds a footnote: “At this point, the choice of units hardly matters; the distance is so immense that whether we choose to measure it in Planck lengths or giga-light years makes little difference.” Let that sink in!

As mind numbing as such figures are, the highest numbers contemplated by humans come not from physics but from pure mathematics and computer science. Like “Graham’s number” — an immense figure put forward as the upper-bound for solutions to a problem in a branch of mathematics known as Ramsey theory. Some readers may find the ensuing discussion of multi-dimensional hypercubes a bit challenging, but one can enjoy the payoff regardless: We end up with a number that can’t even be expressed in conventional notation, and which earned a mention in the 1980 edition of the “Guinness Book of World Records” as “the highest number ever used in a mathematical proof.”

Reading this book is a little bit like sitting in the back row of an auction house where a rare Picasso (let’s say) is up for grabs: How high is this thing going to go? And indeed, Elwes keeps going. We eventually meet the so-called busy beaver numbers, a set of numbers that crop up in theoretical computer science, when one tries to deduce whether a particular computer program will eventually stop, or keep going forever — a conundrum known as the “halting problem.” As Elwes explains, it’s not at all straightforward to distinguish the two types of programs (and if it was, it would help mathematicians tackle some of the most vexing problems in their field).

The fifth busy beaver number, known as BB(5) — associated with a computer program that can access five internal states — works out to 47,176,870. And that’s as far as we’ve gotten, Elwes explains. No one has worked out the value of BB(6), but he assures us that it’s beyond the range of any physical computer; and BB(16) leaves even Graham’s number in the dust.

But wait, there’s more! “Rayo’s number,” concocted by Agustín Rayo — a dean and professor at MIT — using set theory, is bigger still (here’s a fun video about it); and “Fish 7,” mentioned in the book’s subtitle, named for a Japanese googologist who goes by the pseudonym “Fish,” builds on Rayo’s number, and … well, the details are not easily digested, but the mind-melting nature of these numbers comes across as a feature, not a bug, of Elwes’s story… the narrative is enlivened by explorations of the peculiarities of math history…

… Archimedes tried to estimate how many grains of sand would be needed to fill up the known universe, back in the third century B.C. Did he simply have too much time on his hands? Not at all, insists Elwes: The Greek thinker was articulating an important idea — that no matter how unfathomably large a quantity may be, we can describe it with precision, thanks to mathematics. “Archimedes,” he writes, “was penning a manifesto for the expressive power of large numbers.”…

… [Elwes focuses] on numbers that are ridiculously large and yet finite. In the end, perhaps this is the most mind-boggling fact of all: that these enormous numbers, from Graham’s number to Fish 7 and beyond, fall as far short of infinity as does the humble number 1…

The mysteries of the massive: “The Mind-Boggling Science of Enormous Numbers,” @danfalk.bsky.social on @richardelwes.bsky.social in @undark.org.

* Steven Strogatz

###

As we enumerate enormity, we might spare a thought for a seminal mathematician, Alan Turing; he died on this date in 1954. He was a foundational computer science pioneer (inventor of the Turing Machine (an influential model for the general-purpose computer), creator of the “Turing Test” (only too relevant in these AI-infected times), inspiration for “The Turing Award” (the “Nobel Prize of computing“), and cryptographer (leading member of the team that cracked the Enigma code during WWII).  

source

oh dang Turing Machine IS fun as I hoped. Fast though.

#BoardGames #TuringMachine #BoardGameArena

#wiskunde #turingmachine

Soms ontdek je zomaar onverwachts echt van die diamantjes op Youtube.

Comprimeren van programma's in multi tape Turing machines:
https://youtu.be/8JuWdXrCmWg

Wat gebeurt er in een LLM? Zelden zo'n compacte goed geïllustreerde uitleg gezien.

https://youtu.be/VkHfRKewkWw

#wiskunde #turingmachine

Soms ontdek je zomaar onverwachts echt van die diamantjes op Youtube.

Comprimeren van programma's in multi tape Turing machines:
https://youtu.be/8JuWdXrCmWg

Wat gebeurt er in een LLM? Zelden zo'n compacte goed geïllustreerde uitleg gezien.

https://youtu.be/VkHfRKewkWw

@beka_valentine I picture:

#TheBaroqueCycle

https://en.wikipedia.org/wiki/The_Baroque_Cycle

Especially the #TechnologickalCollege in

#TheSystemOfTheWorld

https://en.wikipedia.org/wiki/The_System_of_the_World_(novel)

By #NealStephenson in addition to his handling of #Turing in his

#Cryptonomicon

https://en.wikipedia.org/wiki/Cryptonomicon

We still use the purely theoretical #TuringMachine as a base measure of a computional system.

So often it takes a concentration of resources, enabling an inventor to try and fail, over and over again, often at great expense.

@beka_valentine I picture:

#TheBaroqueCycle

https://en.wikipedia.org/wiki/The_Baroque_Cycle

Especially the #TechnologickalCollege in

#TheSystemOfTheWorld

https://en.wikipedia.org/wiki/The_System_of_the_World_(novel)

By #NealStephenson in addition to his handling of #Turing in his

#Cryptonomicon

https://en.wikipedia.org/wiki/Cryptonomicon

We still use the purely theoretical #TuringMachine as a base measure of a computional system.

So often it takes a concentration of resources, enabling an inventor to try and fail, over and over again, often at great expense.

Every single talk that I saw from @rosa is just fantastic and highly recommended. 🤩

https://rosa.codes/machines2025/

#brightonruby #rubyconference #RubyProgramming #godelianriddle #goedelianriddle #hilbertsprogram #decidability #entscheidungsproblem #brightonruby2025 #turingmachine #smullyan #raymondsmullyan

Every single talk that I saw from @rosa is just fantastic and highly recommended. 🤩

https://rosa.codes/machines2025/

#brightonruby #rubyconference #RubyProgramming #godelianriddle #goedelianriddle #hilbertsprogram #decidability #entscheidungsproblem #brightonruby2025 #turingmachine #smullyan #raymondsmullyan

I have no idea how this works, but I love it!

Turing Machine, a punch card computer puzzle game. Your three chosen numbers produce a punch card that can be used to test certain conditions (e.g Blue is even.)

Great fun, challenging, and unique.

#BoardGames #TuringMachine #Reviews

I have no idea how this works, but I love it!

Turing Machine, a punch card computer puzzle game. Your three chosen numbers produce a punch card that can be used to test certain conditions (e.g Blue is even.)

Great fun, challenging, and unique.

#BoardGames #TuringMachine #Reviews

Turing-Drawings

https://github.com/maximecb/Turing-Drawings

#HackerNews #TuringDrawings #TuringMachine #GitHub #ArtTech #CreativeCoding #TechInnovation

Turing-Drawings

https://github.com/maximecb/Turing-Drawings

#HackerNews #TuringDrawings #TuringMachine #GitHub #ArtTech #CreativeCoding #TechInnovation

How to Optimize Rust for Slowness: Inspired by New Turing Machine Results

https://medium.com/@carlmkadie/how-to-optimize-your-rust-program-for-slowness-eb2c1a64d184

#HackerNews #Rust #Optimization #TuringMachine #Programming #SlowPerformance

How to Optimize Rust for Slowness: Inspired by New Turing Machine Results

https://medium.com/@carlmkadie/how-to-optimize-your-rust-program-for-slowness-eb2c1a64d184

#HackerNews #Rust #Optimization #TuringMachine #Programming #SlowPerformance

@ramin_hal9001 ooh. If you look at all possible computer programs only very simple ones can be written with branching (if else) and loops.

But all computer programs (no matter how hard or genius the algorithm is) can be written with branching and recursion. So I would just assume they’re doing something very smart by using a recursive algorithm 😆

#functionalprogramming #computerscience #turingmachine #algorithms #startrek

It is capable of simulating computations using 7-bit instructions over a total of 224 bits (about 14 bytes), allowing it to theoretically run 2^224 different programs.

#lego #ideas #legoideas #turing #turingmachine #machine #functional #model #computation #computer #mechanical #programming

It is fully mechanical, constructed from over 2,900 LEGO pieces, runs without electricity and is powered by a hand crank.

The machine has a moving head that reads and writes symbols on a physical tape that supports four symbols and eight states, allowing for 32 possible symbol-state combinations.

#lego #ideas #legoideas #turing #turingmachine #machine #functional #model #computation #computer #mechanical #programming

So, someone has built a working Turing machine entirely out of Lego bricks, and the project has advanced to the next stage of review by Lego Ideas after gaining 10,000 supporters.

https://ideas.lego.com/projects/10a3239f-4562-4d23-ba8e-f4fc94eef5c7

#lego #ideas #legoideas #turing #turingmachine #machine #functional #model #computation #computer #mechanical

This is probably the coolest #Lego build I've ever seen. They built a working #TuringMachine entirely out of Lego Technics!

https://ideas.lego.com/projects/10a3239f-4562-4d23-ba8e-f4fc94eef5c7/updates#content_nav_tabs

This is probably the coolest #Lego build I've ever seen. They built a working #TuringMachine entirely out of Lego Technics!

https://ideas.lego.com/projects/10a3239f-4562-4d23-ba8e-f4fc94eef5c7/updates#content_nav_tabs

There are two ways to view a computer program. The first one is the execution-oriented view, in which a program is a sequence of steps that are executed by a computer. The second is the problem-oriented view, where a program solves a problem by a combination of executing elementary steps and calling subprograms that solve subproblems.

The earliest model for the execution-oriented view is the Turing machine, and that for the problem-oriented view is the lambda calculus.

This explains why execution-oriented questions like computational complexity are described and solved in terms of Turing machines, while all programming languages that are used in the real world have the function-calling structure of the lambda calculus.

#Computation #TuringMachine #LambdaCalculus #ProgrammingLanguages

There are two ways to view a computer program. The first one is the execution-oriented view, in which a program is a sequence of steps that are executed by a computer. The second is the problem-oriented view, where a program solves a problem by a combination of executing elementary steps and calling subprograms that solve subproblems.

The earliest model for the execution-oriented view is the Turing machine, and that for the problem-oriented view is the lambda calculus.

This explains why execution-oriented questions like computational complexity are described and solved in terms of Turing machines, while all programming languages that are used in the real world have the function-calling structure of the lambda calculus.

#Computation #TuringMachine #LambdaCalculus #ProgrammingLanguages

(@)lewismenelaws [Instagram]: #computing #lego #TuringMachine

https://www.instagram.com/reel/DBbxKlAu0Ag/?igsh=MTI4djBvYTdoNGk2MA==

(@)lewismenelaws [Instagram]: #computing #lego #TuringMachine

https://www.instagram.com/reel/DBbxKlAu0Ag/?igsh=MTI4djBvYTdoNGk2MA==

Let's make this a reality folks!

https://ideas.lego.com/s/p:10a3239f45624d23ba8ef4fc94eef5c7

Thanks to @lcheylus and @cstross for bringing it to my attention.

#LegoIdeas #TuringMachine

Let's make this a reality folks!

https://ideas.lego.com/s/p:10a3239f45624d23ba8ef4fc94eef5c7

Thanks to @lcheylus and @cstross for bringing it to my attention.

#LegoIdeas #TuringMachine

The Turing Machine Made Real, In LEGO https://hackaday.com/2024/10/07/the-turing-machine-made-real-in-lego/ #computerhacks #turingmachine #legoideas #toyhacks #lego

The Turing Machine Made Real, In Lego - The British mathematician and pioneer of computing Alan Turing published a paper i... - https://hackaday.com/2024/10/07/the-turing-machine-made-real-in-lego/ #computerhacks #turingmachine #legoideas #toyhacks #lego

The Turing Machine Made Real, In Lego - The British mathematician and pioneer of computing Alan Turing published a paper i... - https://hackaday.com/2024/10/07/the-turing-machine-made-real-in-lego/ #computerhacks #turingmachine #legoideas #toyhacks #lego

The Turing Machine Made Real, In Lego https://hackaday.com/2024/10/07/the-turing-machine-made-real-in-lego/ #computerhacks #Turingmachine #Legoideas #ToyHacks #lego

The Turing Machine Made Real, In Lego https://hackaday.com/2024/10/07/the-turing-machine-made-real-in-lego/ #computerhacks #Turingmachine #Legoideas #ToyHacks #lego

Hi #Informatik-Bubble, jemand hat eine #TuringMachine aus #Lego entwickelt, hier könnt ihr die Idee unterstützen: https://ideas.lego.com/projects/10a3239f-4562-4d23-ba8e-f4fc94eef5c7
Und hier gibt es noch ein Video: https://youtu.be/8AA3E05axHw

#InformatikEdu #physikedu #maker #computer #mechanics

Hi #Informatik-Bubble, jemand hat eine #TuringMachine aus #Lego entwickelt, hier könnt ihr die Idee unterstützen: https://ideas.lego.com/projects/10a3239f-4562-4d23-ba8e-f4fc94eef5c7
Und hier gibt es noch ein Video: https://youtu.be/8AA3E05axHw

#InformatikEdu #physikedu #maker #computer #mechanics

A brilliant implementation of a #TuringMachine in #LEGO: https://www.youtube.com/watch?v=tSLOgkNFzLc 🤓

#Turing #ComputerScience #programming #videos

A brilliant implementation of a #TuringMachine in #LEGO: https://www.youtube.com/watch?v=tSLOgkNFzLc 🤓

#Turing #ComputerScience #programming #videos

In the Beginning, There Was Computation https://nautil.us/in-the-beginning-there-was-computation-787023
"life is code, and code is life… individual computational instructions are the irreducible quanta of life—the minimal replicating set of entities, however immaterial and abstract they may seem, that come together to form bigger, more stable, and more complex replicators, in ever-ascending cascades."
#math #turingMachine #vonNeumann #neuroscience #ai

In the Beginning, There Was Computation https://nautil.us/in-the-beginning-there-was-computation-787023
"life is code, and code is life… individual computational instructions are the irreducible quanta of life—the minimal replicating set of entities, however immaterial and abstract they may seem, that come together to form bigger, more stable, and more complex replicators, in ever-ascending cascades."
#math #turingMachine #vonNeumann #neuroscience #ai

I know I've seen people use Turing machines for music sequencing, but how does this actually work? Like, has anyone published a how to guide to their own techniques?

I'm asking because of the Busy Beaver Breakthrough: https://www.quantamagazine.org/amateur-mathematicians-find-fifth-busy-beaver-turing-machine-20240702

The behaviour of Skelet no 1 seems musically useful … or, like a smaller version seems musically useful.

#TuringMachine

I know I've seen people use Turing machines for music sequencing, but how does this actually work? Like, has anyone published a how to guide to their own techniques?

I'm asking because of the Busy Beaver Breakthrough: https://www.quantamagazine.org/amateur-mathematicians-find-fifth-busy-beaver-turing-machine-20240702

The behaviour of Skelet no 1 seems musically useful … or, like a smaller version seems musically useful.

#TuringMachine

CFP: From the Turing Machine to ChatGPT
Explore the intersection of art and science in the digital age. Submit your papers on topics like digital literature, AI, virtual reality, and more.
Deadline: 15 September 2024
#DigitalTechnology #AI #DigitalArt #Humanities #CallForPapers #ChatGPT #TuringMachine
https://www.pulse-journal.org/open-call

CFP: From the Turing Machine to ChatGPT
Explore the intersection of art and science in the digital age. Submit your papers on topics like digital literature, AI, virtual reality, and more.
Deadline: 15 September 2024
#DigitalTechnology #AI #DigitalArt #Humanities #CallForPapers #ChatGPT #TuringMachine
https://www.pulse-journal.org/open-call

Played a few games of #TuringMachine this morning with old man Tarzan keeping me company. The standard difficulty challenges were enjoyable, but the harder verifier cards are confusing and throwing me for loops. (I believe that they only verify one criteria for the given challenge? Not sure…) Regardless, puzzles are good for the brain!

#BoardGames #SoloBoardGaming #catsofmastodon #puzzles

Grazie a @EnzoPapini proviamo questa implementazione della macchina di Turing sul nostro amatissimo Commodore 64. Vediamo come funziona! #commodore64 #turingmachine #BASIC https://www.youtube.com/watch?v=yaHx2-ux-M8

Play with our Turing Machine simulation 🥰 Opening hours: Thu-Fri 4pm-8pm, Sat 10am-4pm, more information at: https://www.racunalniski-muzej.si/en/visit-us/

#computermuseum #computerhistory #slovenia #ljubljana #softwareheritage #digitalheritage #nostalgia #turing #museo #retrocomputing #turingmachine #vintagecomputer #vintagecomputing #informatica #elettronica #maker #tecnica

もはやRustのマクロはチューリング完全だから
https://qiita.com/Snowman-s/items/07751f157df5dd4e758f?utm_campaign=popular_items&utm_medium=feed&utm_source=popular_items

#qiita #Rust #TuringMachine

Turing Complete Origami - Origami can be an interesting starting point for a project, but we weren’t expecti... - https://hackaday.com/2024/02/21/turing-complete-origami/ #turingcomplete #computerhacks #turingmachine #origami

Play with our Turing Machine simulation 🥰 Opening hours: Thu-Fri 4pm-8pm, Sat 10am-4pm, more information at: https://www.racunalniski-muzej.si/en/visit-us/

#computermuseum #computerhistory #slovenia #ljubljana #softwareheritage #digitalheritage #nostalgia #turing #turingmachine #retrocomputing #vintagecomputer #vintagecomputing

Do people in Data Science tend to understand what the halting problem is actually about?

Do people tend to understand what Gödel Incompleteness is actually about?

Do people tend to understand that Wittgenstein's early efforts into a formal system of language (Tractatus Logico-Philosophicus) was an utter failure, to the extent that Wittgenstein became sure (because of how badly it failed) that language isn't a formal system at all, just some sort of arcane racket ball...?

#science #turing #turingmachine #Gödel #incompleteness #Tractatus