On the Birthday of Father of Computer Science and Artificial intelligence Computer Science |
- On the Birthday of Father of Computer Science and Artificial intelligence
- Google's Quantum Processor May Achieve Quantum Supremacy in Months Due to 'Doubly Exponential' Growth in Power
- Make Quicksort fast by using threads and avoiding branch misprediction
- Any suggestions for a good language to self-teach?
- How To Test Drive 200+ Linux Distributions Without Ever Downloading Or Installing Them
- Make a Simple Operating System
- Free mentoring in programming :)
- Can a poly-time problem exist in HALT, if I managed to reduce it to HALT(Poly-time < p HALT)?
| On the Birthday of Father of Computer Science and Artificial intelligence Posted: 23 Jun 2019 07:19 PM PDT |
| Posted: 23 Jun 2019 06:31 PM PDT |
| Make Quicksort fast by using threads and avoiding branch misprediction Posted: 23 Jun 2019 05:11 AM PDT |
| Any suggestions for a good language to self-teach? Posted: 23 Jun 2019 10:05 PM PDT Hey everybody, I'm a CS student and I was wondering if anyone has any suggestions on languages that are self-teachable? I am starting on python but was wondering if there were any other plausible options. Also if y'all know any good resources like codeacademy and such. (I'm trying to learn more on my own, as my college doesn't have great CS professor(s)) Thanks for your time and sorry for the lengthy post lol [link] [comments]  |
| How To Test Drive 200+ Linux Distributions Without Ever Downloading Or Installing Them Posted: 23 Jun 2019 02:58 PM PDT |
| Make a Simple Operating System Posted: 23 Jun 2019 02:53 PM PDT |
| Free mentoring in programming :) Posted: 23 Jun 2019 03:42 PM PDT I have setup a community a few weeks ago for people to find studybuddies, request exercises - and get feedback, get long-term mentoring, ask questions and hangout. This is for almost all languages. If there's a language missing, just hit me up! If you are interested, you're welcome. If you're not, well.. Sorry for this post then, hope you don't find it annoying it's all free! The link: https://discord.gg/bhSwuDS [link] [comments]  |
| Can a poly-time problem exist in HALT, if I managed to reduce it to HALT(Poly-time < p HALT)? Posted: 23 Jun 2019 08:50 AM PDT Recently, I found a poly-time problem exists in HALT. I find this strange because, P is a subset of NP but I'm under the impression that HALT exists outside of NP. So how can a P problem exist in P and NP and outside of NP? Why would P exist outside of NP??? Here's the link to my particular problem that exists in P https://www.reddit.com/r/P_vs_NP/comments/c3wfua/if_a_npcomplete_problem_reduces_to_another_nphard/?utm_source=share&utm_medium=web2x [link] [comments]  |
| You are subscribed to email updates from Computer Science: Theory and Application. To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google, 1600 Amphitheatre Parkway, Mountain View, CA 94043, United States | |
No comments:
Post a Comment