4.6 • 1K Ratings
🗓️ 6 August 2024
⏱️ 35 minutes
🧾️ Download transcript
Click on a timestamp to play from that location
0:00.0 | You're listening to a Glassbox Media Podcast. |
0:07.0 | Welcome back or welcome to the I Can't Sleep Podcast where I read random articles from across the web to bore you to sleep with my soothing voice. |
0:19.0 | I'm your host Benjamin Boster. |
0:22.0 | Today's episode is from a Wikipedia article titled |
0:25.6 | algorithm. In mathematics and computer science an algorithm is a finite sequence of mathematically rigorous |
0:36.6 | instructions typically used to solve a class of specific problems were to perform a computation. |
0:46.0 | Algorithms are used as specifications for performing calculations and |
0:54.2 | more advanced algorithms can use conditionals to divert the code execution through |
0:59.2 | various routes referred to as automated decision-making and deduce valid inferences |
1:06.2 | referred to as automated reasoning, achieving automation eventually. |
1:12.1 | Using human care achieving automation eventually. |
1:19.0 | Using human characteristics as descriptors of machines in metaphorical ways was already practiced by Alan Turing with terms such as memory, search, and stimulus. |
1:29.1 | In contrast, a heuristic is an approach to problem solving that may not be fully specified or may not guarantee |
1:37.2 | correct or optimal results, especially in problem domains where there is no well defined correct or optimal result. |
1:46.8 | For example, social media recommender systems rely on heuristics in such a way that, although widely characterized as algorithms in 21st century |
1:56.5 | popular media, cannot deliver correct results due to the nature of the problem. |
2:04.0 | As an effective method, an algorithm can be expressed within a finite amount of space and time |
2:10.0 | and in a well-defined formal language for calculating a function. |
2:15.0 | Starting from an initial state and initial input, perhaps empty, |
2:20.0 | the instructions describe a computation that when executed proceeds through a finite |
2:27.0 | number of well-defined successive states, eventually producing output and terminating at a final ending state. |
2:37.0 | The transition from one state to the next is not necessarily deterministic. Some algorithms, known as randomized algorithms, incorporate random input. |
... |
Please login to see the full transcript.
Disclaimer: The podcast and artwork embedded on this page are from Benjamin Boster & Glassbox Media, and are the property of its owner and not affiliated with or endorsed by Tapesearch.
Generated transcripts are the property of Benjamin Boster & Glassbox Media and are distributed freely under the Fair Use doctrine. Transcripts generated by Tapesearch are not guaranteed to be accurate.
Copyright © Tapesearch 2025.