Reintroducing Dip - My take on a programming language for beginners Computer Science |
- Reintroducing Dip - My take on a programming language for beginners
- How to break into algorithmic research? What are the prerequisites? How much math is involved?
- [Self Promotion] I’m sorry if this isn’t the right place to post, but I wanted to share this. I am a C# software engineer who works with Genetic Algorithms. Today marks my 8th video in the series, where we make our simulation multi threaded, add test cases and make our GA multi-objective!
- Find the Hard Work You're Willing to Do
- [R] Open discussion on deep robustness, please!
- Roast my new web app fellow computer(wo)manz
- Django Middleware
- Reasons why it is important to learn Statistics for machine learning
- JavaScript Cheatsheet
- Data Science vs Machine Learning
- The best way to Learn Artificial Intelligence for a Beginner
- How do I find the original message of a received Polynomial Code with error?
- x3: new dictionary compressor, comparable to the best dictionary methods like xz, zstd, or Brotli
- Accounting: How will automation and artificial intelligence affect demand for accountants in the impending decades?
- [N] ICML 2020 Announces Test of Time Award
- Wanting to get your feedback on an upcoming collaborative software development program survey.
- Do you think the existence of one way functions has anything to do with the non commutative/non linear property?
- Array proprties and inference rules
- Best Java learning tips for competitive programming
Reintroducing Dip - My take on a programming language for beginners Posted: 06 Jul 2020 11:07 PM PDT Hello. A few weeks ago, I had posted a very basic version of a programming language that I put together, called Dip. I was blown away by the kind and honest feedback given by the community, and have worked on it, adding examples of Dip code so users can get to know the language, adding a learning path for beginners so that they can learn how to code in a streamlined fashion, and also changing the site to match the language's identity. So now, I (re)introduce you to Dip, a small project I've been working on, which also happens to be a programming language targeting beginners. I've tried to make the syntax easy to understand, and also tried to make the language easy to read and write for complete beginners. I've tried to eliminate a few issues the Python language has (such as indentation and error messages), though it is up to you to see to what extent Dip succeeds. I've also tried to allow Dip to communicate with Python, so users are not limited to Dip's features, because the way I see it, Dip is not meant to compete with Python, and does not aim to, but I think Dip's simpler syntax and error messages might be useful to beginners in some cases and get them up the learning ladder, and I would love to see Dip being used as a stepping stone by the Python community, learning the ropes using Dip, and then moving on to Python. You can look at Dip's website at dip-lang.org. I would love your feedback on how I could improve the language. Also, if you wish to contribute to this small venture of mine, feel free to help me with the core language or the site on Github. [link] [comments] |
How to break into algorithmic research? What are the prerequisites? How much math is involved? Posted: 07 Jul 2020 03:00 AM PDT Hi Iam a computer science sophomore . Algorithms and their design is my favourite subjects so far. I am using clra at the moment and have completed most of the chapters and the exercises.I love it so far. So I thought maybe I would try research on the field. Iam pretty good at discrete math , but suck at algebra. What kind of mathematics would I require for getting ahead in this field? And how would I do it? [link] [comments] |
Posted: 07 Jul 2020 04:55 AM PDT A bit more background - I work with a company that creates scheduling applications for mine sites, and our team works heavily with genetic algorithms - they're our core product. I really enjoy genetic algorithms and have used them for a number of random projects, a few of which can be found on my github here: https://github.com/Gary-The-Cat. I wanted to share my love for them, so I've made a series. In this series, we are solving the traveling salesman problem. In today's video, I go through the changes I have made to our current system to support and implement multi-objective. All source code is provided, so if you're interested and want to follow along, please check it out! https://github.com/Gary-The-Cat/MultiObjective Multi-objective Video: Introduction video: [link] [comments] |
Find the Hard Work You're Willing to Do Posted: 06 Jul 2020 06:18 AM PDT |
[R] Open discussion on deep robustness, please! Posted: 07 Jul 2020 04:42 AM PDT |
Roast my new web app fellow computer(wo)manz Posted: 07 Jul 2020 12:13 AM PDT |
Posted: 07 Jul 2020 03:32 AM PDT |
Reasons why it is important to learn Statistics for machine learning Posted: 07 Jul 2020 02:17 AM PDT |
Posted: 07 Jul 2020 01:52 AM PDT |
Data Science vs Machine Learning Posted: 07 Jul 2020 01:51 AM PDT |
The best way to Learn Artificial Intelligence for a Beginner Posted: 07 Jul 2020 12:02 AM PDT |
How do I find the original message of a received Polynomial Code with error? Posted: 06 Jul 2020 11:24 PM PDT The received message (5,0,1,3) is coding a number sequence of length 2 over F7 as polynom with the 4 knot points a1 = 0, a2 = 1, a3 = 2, a4 = 6 . In the transmission an error occured. Find the original message. How do I do this? Any clue? Thanks for any help. [link] [comments] |
x3: new dictionary compressor, comparable to the best dictionary methods like xz, zstd, or Brotli Posted: 06 Jul 2020 07:32 AM PDT |
Posted: 06 Jul 2020 02:45 PM PDT Will we see accountants die out within our lifetimes due to technology, or at least see a great drop in demand? [link] [comments] |
[N] ICML 2020 Announces Test of Time Award Posted: 06 Jul 2020 09:18 AM PDT Organizers of the 37th International Conference on Machine Learning (ICML) have announced this year's Test of Time award, which goes to a team from the California Institute of Technology, University of Pennsylvania, Saarland University. The ICML Test of Time award recognizes an ICML paper from ten years ago that has proven influential, with significant impacts in the field, "including both research and practice." Test of Time Award: Gaussian Process Optimization in the Bandit Setting: No Regret and Experimental Design Here is a quick read: ICML 2020 Announces Test of Time Award [link] [comments] |
Wanting to get your feedback on an upcoming collaborative software development program survey. Posted: 06 Jul 2020 09:10 AM PDT Hey everyone! I am an intern working in partnership with the HOFT institute in Austin, Texas to develop an online collaborative software development course. We want to teach commonly used development platforms and workflows, in hopes to give hands-on experience via group-based projects/modules. We're looking to collect feedback on what aspects of learning programming are important to you. We'll use this feedback to influence the potential course format, schedule, and design. Thank you so much for your help! https://docs.google.com/forms/d/1MyR68XyE5gjVaF912Y7QxmaLVdQJZnFTcqnuBWzAh50/edit [link] [comments] |
Posted: 06 Jul 2020 11:13 AM PDT The thing the non commutative/non linear property have in common is that they are more complex than the commutative/linear property. This complexity may explain why one way functions exist [link] [comments] |
Array proprties and inference rules Posted: 06 Jul 2020 07:04 AM PDT I have a question about the soundness of the Universal Generalization Rule Over array Properties in proof i am working on To give some hints about the problem: suppose that f(x) and g(x) represent an array read operation respectively from A and B i.e f(x) =A[x] and g(x) =B[x] given ( ∀x ϵ D,max ϵ D, g(x) < g(max)∀x ϵ D,max ϵ D, g(x) < g(max)) And ( ∀x ϵ D, −(f(x)+c) <g(x)< (f(x)+c) ∀x ϵ D, −(f(x)+c) <g(x)< (f(x)+c) ) prove : ( ∀x ϵ D,max ϵ D, f(x)−2c < f(max)∀x ϵ D,max ϵ D, f(x)−2c < f(max)) Proof idea is to use the universal instantiation rule to prove the that ( max ϵ D, f(y)−2c < f(max) max ϵ D, f(y)−2c < f(max) ) for an arbitrary y ϵ Dy ϵ D then apply the universal generalization rule to deduce that ( ∀x ϵ D,max ϵ D, f(x)−2c < f(max)∀x ϵ D,max ϵ D, f(x)−2c < f(max)) my Question is that is my generalization rule is sound ? if Yes is the resulting formula equivalent to the original one ? [link] [comments] |
Best Java learning tips for competitive programming Posted: 06 Jul 2020 05:39 AM PDT |
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