Category Archives: Programming

Error: File association not found for extension .py

secretweaponsdigital

To fix “File association not found for extension .py” on Windows, execute the following two commands in a cmd.exe with administrator privileges:

assoc .py=py_auto_file
ftype py_auto_file="C:Anacondapython.exe" "%1" %*

The first creates an file association. The second sets the program used to execute the file.

View original post

Advertisements

Artificial Intelligence – Depth First Search(DFS)

Depth-first search (DFS) is an algorithm for traversing or searching tree or graph data structures. One starts at the root (selecting some arbitrary node as the root in the case of a graph) and explores as far as possible along each branch before backtracking.

A version of depth-first search was investigated in the 19th century by French mathematician Charles Pierre Trémaux[1] as a strategy for solving mazes.

Algorithmic Thoughts - Artificial Intelligence | Machine Learning | Neuroscience | Computer Vision

Okay! So this is my first blog post!

I will start by talking about the most basic solution to search problems, which are an integral part of artificial intelligence.

What the hell are search problems?

In simple language, search problems consist of a graph, a starting node and a goal(also a node). Our aim while solving a search problem is to get a path from the starting node to the goal.

Consider the diagram below, we want to get to the node G starting from the node S.

Which path will we get on solving the search problem? How do we get the path? This is where algorithms come into picture and answer all our questions! We will look at Depth First Search which can be seen as a brute force method of solving a search problem.

Creating the search tree

So how do we simplify this problem? If we…

View original post 623 more words

Link

by Cleve Moler

Online Resources

Book Summary

Numerical Computing with MATLAB is a textbook for an introductory course in numerical methods, MATLAB, and technical computing. It emphasizes the informed use of mathematical software. Topics include matrix computation, interpolation and zero finding, differential equations, random numbers, and Fourier analysis.

Based on MATLAB, the textbook provides more than 70 M-files. Many of the more than 200 exercises involve modifying and extending these programs. The book also makes extensive use of computer graphics, including interactive graphical expositions of numerical algorithms.

Two editions of the book have been published. An electronic edition, published by The MathWorks, is available from this Web site. A traditional textbook print edition, published by the Society for Industrial and Applied Mathematics, is available from the SIAM Web site.

La escalabilidad del computo

Published on Aug 26, 2014

Hackerdashery #2

Inspired by the Complexity Zoo wiki: https://complexityzoo.uwaterloo.ca/Co…

Scott Aaronson’s blog, Shtetl-Optimized:http://www.scottaaronson.com/blog/

—–

Retro-fabulous, cabinet-sized computers:

System/360: http://en.wikipedia.org/wiki/IBM_Syst…

photo: “360-91-panel”. Licensed under Public domain via Wikimedia Commons –http://commons.wikimedia.org/wiki/Fil…

PDP-8: http://en.wikipedia.org/wiki/PDP-8

photo: “PDP-8”. Licensed under Public domain via Wikimedia Commons –http://commons.wikimedia.org/wiki/Fil…

—–

Protein folding illustration: “Protein folding schematic” by Tomixdf (talk) – Own work (Original text: “self-made”). Licensed under Public domain via Wikimedia Commons –http://commons.wikimedia.org/wiki/Fil…

P vs. NP opinion poll: http://www.cs.umd.edu/~gasarch/papers…

Continue reading