Undecidable problems | Theory of computation | Mathematical problems | Computability theory

Halting problem

In computability theory, the halting problem is the problem of determining, from a description of an arbitrary computer program and an input, whether the program will finish running, or continue to run forever. Alan Turing proved in 1936 that a general algorithm to solve the halting problem for all possible program–input pairs cannot exist. For any program f that might determine whether programs halt, a "pathological" program g, called with some input, can pass its own source and its input to f and then specifically do the opposite of what f predicts g will do. No f can exist that handles this case. A key part of the proof is a mathematical definition of a computer and program, which is known as a Turing machine; the halting problem is undecidable over Turing machines. It is one of the first cases of decision problems proven to be unsolvable. This proof is significant to practical computing efforts, defining a class of applications which no programming invention can possibly perform perfectly. Jack Copeland attributes the introduction of the term halting problem to the work of Martin Davis in the 1950s. (Wikipedia).

Video thumbnail

How to end traffic jams once and for all

Have you ever wondered what causes traffic? Indeed, what or who is responsible for the most time-consuming traffic jams? Is it human error? Poor city planning? Accidents? According to experts, the most significant contributor to extreme traffic is poor decision-making by humans. At first

From playlist All About Transportation

Video thumbnail

Engine over run - Basics

This video explains about the basics of engine over run. A detailed video animation will be uploaded later. As you all know, the engine has a limited maximum speed at which it operates. But if we abuse the vehicle, the engine speed rises beyond the limited maximum speed. This phenomenon

From playlist Automobile Engineering.

Video thumbnail

The Problem of Traffic: A Mathematical Modeling Journey

How can we mathematically model traffic? Specifically we will study the problem of a single lane of cars and the perturbation from equilibrium that occurs when one car brakes, and that braking effect travels down the line of cars, amplifying as it goes along, due to the delayed reaction ti

From playlist Cool Math Series

Video thumbnail

Motorcycle Crash Attack

First the motorcycles are riding together, but then the farmer's motorcycle turns left

From playlist Stop Motion

Video thumbnail

This WON'T Fool you... UNLESS you're a Magician!

*** HIT THE NOTIFICATION BUTTON SO YOU’LL NEVER MISS A VIDEO*** MAKE SURE YOU SUBSCRIBE AND LEAVE A COMMENT IF YOU WANT TO SEE MORE VIDEOS SUBSCRIBE HERE: https://www.youtube.com/CHRISRAMSAY52 Some light-hearted fun for the magicians out there. ;)

From playlist Magician Problems.

Video thumbnail

What makes BIRD STRIKES so dangerous?

Even today there is an aerodynamic phenomenon that is horrifying to most of airplane pilots; the compressor stall. This phenomenon can be triggered by a simple incident such as a bird strike. A compressor stall can lead to a total loss of engine thrust, severe vibrations and loud bangs in

From playlist Aerospace & Aeronautical

Video thumbnail

Introduction to Friction | Statics

https://goo.gl/CcCUJN for more FREE video tutorials covering Engineering Mechanics (Statics & Dynamics) The objectives of this video are to discuss static and kinetic friction followed by the consideration of friction-force plot. Basically, the term friction refers to the resistance offer

From playlist SpoonFeedMe: Engineering Mechanics (Statics & Dynamics)

Video thumbnail

Top 5 Triggers for stress in the workplace

While a small amount of stress can help to motivate us and keep us focused, too much is never a good thing and can lead to serious problems with anxiety and depression. We’ve identified our top 5 triggers for stress in the workplace. 1. Not enough breaks Working through lunch every day m

From playlist Career Challenges

Video thumbnail

The Halting Problem: Theory of Computation (Apr 28, 2021)

This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math & computer science majors at Fairfield University, Spring 2021. Download class notes from class website. Class website: http://cstaecker.fairfield.edu/~cstaecker/courses/2021s3342/

From playlist Math 3342 (Theory of Computation) Spring 2021

Video thumbnail

Theory of Computation: The Halting Problem

This video is for my Spring 2020 section of MA 342, for the class meeting on Tuesday April 21. Fast forward music is from "Now Get Busy" by the Beastie Boys, licensed Creative Commons Noncommercial Sampling Plus.

From playlist Math 342 (Theory of Computation) Spring 2020

Video thumbnail

Computation Ep33, The Halting Problem (Apr 27, 2022)

This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math and computer science majors at Fairfield University, Spring 2022. The course is about finite automata, Turing machines, and related topics. Homework and handouts at the class websi

From playlist Math 3342 (Theory of Computation) Spring 2022

Video thumbnail

Impossible Programs (The Halting Problem)

Some programming problems are so hard that they’re impossible. We look at the first problem to have been proved undecidable, the halting problem, which was instrumental in forming the basis of the modern computer. Created by: Cory Chang Produced by: Vivian Liu Script Editors: Justin Chen,

From playlist Infinity, and Beyond!

Video thumbnail

Halting Problem & Quantum Entanglement 2020 Breakthrough result [MIP*=RE]

This video explains the MIP*=RE result. We skip the proof details, just explain what the result means. Please leave comments in the comment section if something is unclear. The links mentioned in the video: 1) Proof that the halting problem can't be solved: https://youtu.be/92WHN-pAFCs

From playlist Animated Physics Simulations

Video thumbnail

Theory of Computation: A non-RE language

This video is for my Spring 2020 section of MA 342, for the class meeting on Wednesday April 22. Fast forward music is from "Now Get Busy" by the Beastie Boys, licensed Creative Commons Noncommercial Sampling Plus.

From playlist Math 342 (Theory of Computation) Spring 2020

Video thumbnail

Turing & The Halting Problem - Computerphile

Alan Turing almost accidentally created the blueprint for the modern day digital computer. Here Mark Jago takes us through The Halting Problem. Turing Machines Explained: https://youtu.be/dNRDvLACg5Q Busy Beaver: https://youtu.be/CE8UhcyJS0I VR Simulator: http://youtu.be/Lm0lA0enPSk Wh

From playlist Subtitled Films

Video thumbnail

Computation Ep34, Uncomputable numbers (Apr 29, 2022)

This is a recording of a live class for Math 3342, Theory of Computation, an undergraduate course for math and computer science majors at Fairfield University, Spring 2022. The course is about finite automata, Turing machines, and related topics. Homework and handouts at the class websi

From playlist Math 3342 (Theory of Computation) Spring 2022

Video thumbnail

1.11.7 The Halting Problem: Video [Optional]

MIT 6.042J Mathematics for Computer Science, Spring 2015 View the complete course: http://ocw.mit.edu/6-042JS15 Instructor: Albert R. Meyer License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

From playlist MIT 6.042J Mathematics for Computer Science, Spring 2015

Video thumbnail

Stanford CS105: Introduction to Computers | 2021 | Lecture 27.2 Theory: Undecidable Problems

Patrick Young Computer Science, PhD This course is a survey of Internet technology and the basics of computer hardware. You will learn what computers are and how they work and gain practical experience in the development of websites and an introduction to programming. To follow along wi

From playlist Stanford CS105 - Introduction to Computers Full Course

Video thumbnail

How To Stop Smoking!

A different way at trying to quit smoking!

From playlist Funny Videos, Parodies, Odds and ends!

Related pages

Transcendental number | Turing degree | SPARK (programming language) | Brouwer–Hilbert controversy | Undecidable problem | Busy beaver | Tag system | Chaitin's constant | Alonzo Church | Decision problem | Gödel numbering | Probability | Universal Turing machine | Data type | Lambda calculus | Rice's theorem | Oracle machine | Arithmetical hierarchy | Beta normal form | David Hilbert | Model of computation | Computable function | Pseudocode | Entscheidungsproblem | Enumeration | Peano axioms | Julia Robinson | Coq | Normal number | Proof by contradiction | Alan Turing | General recursive function | Heuristic (computer science) | Natural number | Correctness (computer science) | Kolmogorov complexity | Proposition | Church–Turing thesis | Computable number | Turing machine | Natural density | Turing's proof | Effective method | Linear bounded automaton | P versus NP problem | Ernest Nagel | Partial function | Bertrand Russell | Computation | Alfred North Whitehead | Markov algorithm | Numeral system | Cantor's diagonal argument | Algorithm | RE-complete | Reduction (complexity) | Character (computing) | Register machine | Termination analysis | Infinite loop