The Most Difficult Program to Compute? - Computerphile

Video quality	The size	Download

Информация о The Most Difficult Program to Compute? - Computerphile

Название	:	The Most Difficult Program to Compute? - Computerphile
Продолжительность	:	14.55
Дата публикации	:
Просмотров	:	1,3 jt

Fantastic video Professor Brailsford is awesome ❤
Comment from : Mohammad Shahab Rafiq

Know known, know unknown, and unknown unknown
Comment from : Cody Aimes

even aw(3)[1] is above 10^10brsomething has to be wrong with that codebrnote: normally, the numbers in the parentheses are the sequence and the one on brackets is m
Comment from : Eclipse135

I figure the hardest one to compute would be something like busy beaver
Comment from : Micah Starnes

I'm confused, you can simulate a turing machine using for loops and thus can implement ack within that?
Comment from : Ganer

"this is a quad core" which sounds singularly useless for this function
Comment from : qiexia

This problem sounds like it can be reduced with some caching
Comment from : KaMa2

I love computerphile, wish I found out about them when I was in middle or highschool to explore computer science sooner rather than in college
Comment from : kenneth romero

You know you're a true mathematician when you get scared by how big a number can getbrbrAlso makes you appreciate how big infinity actually is It's bigger than any ack out there
Comment from : Kazik Majster

📺💬 Ackerman function is when you can create for loop calculation to continue without interrupting in process and you can perform task update and wait for the final resultbr🥺💬 Yes, but I am thinking and the recursive functions, and how to program them, one way this is what the program allowed but with recursive functions as your example when we have some answers for some steps in the recursive function we can find the relationship between the next in roles with the same step or conclusion ( 🏡(1) 👤🗯💦💦🏡🥺💬 they do not stop to do that try to break focus or create pause 📺💬 วิชาเค้าต้องได้ผล 🥺💬 เค้าคิดไปเองผมแจ้งตำรวจไปหลายทีแล้ว คนเดือดร้อนเค้าไม่สนใจ 📺💬 ฝึกมันด่าเค้าอ้างอย่างนั้น 📺💬 15 ปีได้แค่นี้ว่ะ มันโง่สุดสุดเลยพอใจยัง )brbr🧸💬 Telecommunication programs used to use the Ackerman function for packet deserialization but it has some weak points that perform multiple tasks and itself allowed the same process to create branches and access some values it is not extended memory you do not need to copy out the value but it waiting ( 🏡(2)👤‼ 🔊💬🏡🥺💬 Do you understand they do by intention all sides and speakers I ignored them but they try to sell this subject for money )br🐑💬 In some programs they still need it, see the structure of the program Asynchronyze and Synchronize, read it until the end, and reply or read and send as a continue step in some programming languages the message event is the Ackerman Function
Comment from : Jirayu Kaewprateep

how much energy would that computer use computing that?
Comment from : korre45

These guys remember why we code the way we do Founding fathers indeed
Comment from : De Waard

It's been 15 years I'm working professionally in computer science, writing code and doing something useful with it, thinking that I'm kind of understanding how it all works, from the theory of electronics, to the end user using it, I'm mind blown that some mathematician from the early 20s have already thought of all of this Plus kudos to mr Brallsford explaining it like it's some basic course by its concise explaination Love from France
Comment from : Elias Platek