Thank you for supporting my mission of providing free or accessible education and more.
Log in
I'm a theoretical computer scientist, CS educator, and make games.
Subscription Tiers
$2.70
USD monthly
Thank You!
0 subscribers
$4.70
USD monthly
Special Thank You, and Supporter Access!
Thank you very much for your support. At this level, any newly produced videos will include your name in the description of the video (or, if appropriate in the video itself) as a supporter of this work; on support, Daniel Page will reach out to you in case you wish to not be named, or if you have a particular name you would like Daniel Page to use. Regardless, a video shout of those that wish to be acknowledged will be made on a regular update video on the YouTube channel.
In addition, you will be given priority when making fan video requests. Daniel Page reserves the right to determine if the topic is appropriate for the channel, or something Daniel Page would like to do. Also, you will get access to polling for future video content.
You will get access to the 1st Steps to Computer Programming Using Java notes.
0 subscribers
$9.50
USD monthly
Basic Support
At this tier, you gain access to the written notes that supplement the more basic live stream events, such as the Big-Oh Bootcamp (includes all rewards of lower tiers).
0 subscribers
$19
USD monthly
General Support
At this tier, you will gain access to all written notes in free video content provided by Dr. Page. Notes are in digital format. You will all rewards of tiers lower to this one.
Reward: You receive your own full digitally-signed PDF copy of Daniel Page's newest book, Advanced Data Structures: An Introduction to Data Structures and Algorithms. This 160 page book is the written note companion to Daniel's 33-part video lecture series of the same name (Advanced Data Structures). It is great for accessibility purposes, should one want a supplemental resource or simply a book with all the content in it. This book is available in other formats such as physical paperback and in kindle format on Amazon.
0 subscribers
Features
- Please support my work in making accessible and freely available Computer Science educational content.
- Support the creation of video content that is educational and entertaining.
- Support making Theoretical Computer Science more accessible to a wider population for less. No politically correct nonsense, just great education!
Exploring Properties of Regular Languages - NOTES ATTACHED
Like(0)
Dislike(0)
Posted for $4.70, $9.50, $19 tiers
Graph/Networks and Minimum Spanning Trees, Algorithms and More! [Notes attached]Notes are attached.
Like(0)
Dislike(0)
Posted for $4.70, $9.50, $19 tiers
D.R.Page
Mar 14, 2022 08:45 pm
Public post
Pi Day 2022 - Invited Talk!
https://youtu.be/2O1b6UBqDgQ
In the study of algorithms, we desire provably-correct algorithms that efficiently solve problems. In this talk, the area of approximation algorithms is introduced in the context of determining the existence of efficient algorithms for hard optimization problems. If P is not equal to NP, which is one possibility for the outstanding and fundamental P vs. NP problem, then for some intractable problems there may only exist polynomial-time algorithms that can compute approximately close answers to optimal solutions, but no better than multiplicatively by some “magic number”. The talk will briefly introduce a mixture of algorithms, computational complexity theory, and recent developments focusing on intractable problems intersecting scheduling and graph theory.
https://youtu.be/2O1b6UBqDgQ
In the study of algorithms, we desire provably-correct algorithms that efficiently solve problems. In this talk, the area of approximation algorithms is introduced in the context of determining the existence of efficient algorithms for hard optimization problems. If P is not equal to NP, which is one possibility for the outstanding and fundamental P vs. NP problem, then for some intractable problems there may only exist polynomial-time algorithms that can compute approximately close answers to optimal solutions, but no better than multiplicatively by some “magic number”. The talk will briefly introduce a mixture of algorithms, computational complexity theory, and recent developments focusing on intractable problems intersecting scheduling and graph theory.
On March 14, 2022 I delivered this talk for University of Regina's Pi Day Event (with the Dept. of Math & Stats), organized by the Mathematics, Actuarial Science, and Statistics Student Society (MASS). I am very thankful for their invitation to give this talk! Thank you for the time to talk about Algorithms!
Remark: I did not mention it properly given the time constraints, but Svensson in 2010 proved P|prec|Cmax has no 2-\epsilon approximation algorithm, relying on assumptions of a variant of the Unique Games Conjecture. So if you believe that variant is true, then List Scheduling is optimal with respect to the approximation ratio!
Have a beautiful day!
Like(0)
Dislike(0)
Sign Up or Log In to comment on this post
See something you like? Subscribe to see even more!
Star Stats
61 posts
Other stars
Two For Tea Podcast
Please note that this SubscribeStar page is not actively seeking donations.
Arch Warhammer
Greetings! i am Arch Warhammer and i make Warhammer and 40k Lore videos on YouTube every Friday along with some general strategy content
TheQuartering & MidWestly
Creating consumer advocacy videos for the fandoms of gaming, movies, comics and Real talk news on MidWestly
Isaac Arthur
Science & Futurism with Isaac Arthur is an award-winning weekly video and podcast covering a wide range of topics including space, AI, astronomy, the Fermi Paradox, future civilizations, advanced technologies, and science in general.
Max Rich Music
Guitar technique through a scientific, anatomical approach. Optimizing a player's ability based on physiology so they can achieve the most progress in the shortest time possible.
