サクサク読めて、アプリ限定の機能も多数!
トップへ戻る
パリ五輪
www.norvig.com
This page has two purposes: to describe how to implement computer language interpreters in general, and in particular to build an interpreter for most of the Scheme dialect of Lisp using Python 3 as the implementation language. I call my language and interpreter Lispy (lis.py). Years ago, I showed how to write a semi-practical Scheme interpreter Java and in in Common Lisp). This time around the go
In the October 1999 Communications of the ACM Lutz Prechelt had an interesting article entitled Comparing Java vs. C/C++ Efficiency Issues to Interpersonal Issues which asked 38 programmers to implement versions of a program in C, C++, or Java. The conclusions showed that Java was 3 or 4 times slower than C or C++, but that the variance between programmers was larger than the variance between lang
This is a brief introduction to Python for Lisp programmers. (Although it wasn't my intent, Python programers have told me this page has helped them learn Lisp.) Basically, Python can be seen as a dialect of Lisp with "traditional" syntax (what Lisp people call "infix" or "m-lisp" syntax). One message on comp.lang.python said "I never understood why LISP was a good idea until I started playing wit
One week in 2007, two friends (Dean and Bill) independently told me they were amazed at Google's spelling correction. Type in a search like [speling] and Google instantly comes back with Showing results for: spelling. I thought Dean and Bill, being highly accomplished engineers and mathematicians, would have good intuitions about how this process works. But they didn't, and come to think of it, wh
Jscheme is: Lisp: An interpreter for the Scheme dialect. Java: Written in Pure Java 1.1. Complete: meets the R4RS standard, except for three limitations. Compact: About 50KB source, 30KB classes.jar. Integrated: You can call any Java method. Open: Generous free license agreement. Learn More: Browse the Javadoc documentation. Browse the source code directory. See the Design document. Download the s
First Previous Next Last Index Home Text Slide 1 of 6
by Peter Norvig Note: This page is the original 2006 essay; an updated Python 3 Jupyter notebook is available here and should probably be read instead of this page. In this essay I tackle the problem of solving every Sudoku puzzle. It turns out to be quite easy (about one page of code for the main idea and two pages for embellishments) using two ideas: constraint propagation and search. Sudoku Not
Q: What is an Infrequently Answered Question? A question is infrequently answered either because few people know the answer or because it concerns an obscure, subtle point (but a point that may be crucial to you). I thought I had invented the term for my Java IAQ, but it also shows up at the very informative About.com Urban Legends site. There are lots of Python FAQs around, but this is the only P
Design Patterns in Dynamic Languages First put online 17 March 1998; first presented 5 May 1996 pdf version (recommended) ppt version (recommended) 1998-style html version (not recommended) Peter Norvig
#1 Gettysburg Powerpoint Presentation and its making (slides) #2 AI: A Modern Approach (book) and AI on the Web (links) #3 World's Longest Palindrome (for 20:02 02/20 2002) #4 Teach Yourself Programming in 10 Years (essay) #5 Paradigms of AI Programming (book) with code #6 Java IAQ and Python IAQ (FAQs) #7 Design Patterns in Dynamic Languages (slides) #8 Lisp compared to Python, Java, and itself i
Why is everyone in such a rush? Walk into any bookstore, and you'll see how to Teach Yourself Java in 24 Hours alongside endless variations offering to teach C, SQL, Ruby, Algorithms, and so on in a few days or hours. The Amazon advanced search for [title: teach, yourself, hours, since: 2000 and found 512 such books. Of the top ten, nine are programming books (the other is about bookkeeping). Simi
このページを最初にブックマークしてみませんか?
『Peter Norvig』の新着エントリーを見る
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く