Реклама - двигатель прогресса


<< | 1 | >>

Lecture 9 | programming abstractions (stanford)

Lecture 9 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie goes over recursion and the proper ways to solve problems recursively. She continues with the example of a program that draws a fractal image and explains a Mandarin code to illustrate the different possibilities of drawing different pictures. She then discusses the problem of moving a stack of disks from one peg to the other peg. Later, she demonstrates the basic principle necessary to solve the problem with a child's toy and goes through how to solve the problem with a program. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:36:03 Tags: .

 

---

Lecture 04: decomposition and abstraction through functions; introduction to recursion

Thissubject is aimed at students with little or no programming experience. It aims to provide students with an understanding of the role computation can play in solving problems. It also aims to help students, regardless of their major, to feel justifiable itunes.apple.com This video does not belong to me and I do not claim it as mine. It is a free download from the itunes store, I am just uploading for peoples convenience Category: Howto & Style Length: 00:38:35.250 Tags: .

 

---

Lecture 8 | programming abstractions (stanford)

Lecture 8 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie talks about solving problems recursively. She covers functional recursion with the simple example of writing an exponential function using recursion. From the simple program performing as an exponential function Julie continues to show a more efficient recursion code. The next example she covers is that of binary search and how recursion is used in this instance. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:31:57.750 Tags: .

 

---

Lecture 11 | programming abstractions (stanford)

Lecture 11 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie continues with recursive backtracking and introduces pointers and recursive data. Following, she focuses on solving the problems rather than the exact code and later uses the example of a program that will solve a Sudoku puzzle. She explains that recognizing and looking for patterns between all of the different recursive examples is an important component to learning recursion. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:35:51 Tags: .

 

---

Lecture 10 | programming abstractions (stanford)

Lecture 10 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie explains procedural recursion and introduces permute code. She goes through another example of recursive code line by line, explaining each component. Recursive backtracking and it's usefulness are discussed. The example of placing several queen chess pieces on a board where none of them can attack the other is then demonstrated. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:35:16.500 Tags: .

 

---

Lecture 13 | programming abstractions (stanford)

Lecture 13 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie introduces linked lists and continues to discuss recursive data. She goes line by line through an example code she writes during the lecture. She then inserts variables in an order; she uses the example of an address book to explain this. Algorithm analysis are also introduced. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:38:41.250 Tags: .

 

---

Lecture 12 | programming abstractions (stanford)

Lecture 12 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie continues to go over pointers and moves on to recursive data and linked lists. She starts off explaining the basics of pointers and have two variables pointing to the same address then explains that it is better to not delete the same address more than once, as something not wanted might happen. Julie then explains the interaction between pointers and dynamic arrays. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:31:18.750 Tags: .

 

---

Cs 61a lecture 7: recursion and iteration ii

CS 61A - Spring 08 - TheStructure and Interpretation of Computer Programs Instructor Brian Harvey Introduction to programming and computer science. This course exposes students to techniques of abstraction at several levels: (a) within a programming language, using higher-order functions, manifest types, data-directed programming, and message-passing; (b) between programming languages, using functional and rule-based languages as examples. It also relates these techniques to the practical problems of implementation of languages and algorithms on a von Neumann machine. There are several significant programming projects, programmed in a dialect of the LISP language. www.cs.berkeley.edu Category: Education Length: 00:38:09 Tags: .

 

---

Lecture 7 | programming abstractions (stanford)

Lecture 7 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie explains the idea of functions as data and specific plot functions and continues onto client feedback functions and ADTs. She then delves into recursion and solving problems using recursion. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:35:39 Tags: .

 

---

Cs 61a lecture 8: ui recursion and iteration iii

CS 61A - Spring 08 - TheStructure and Interpretation of Computer Programs Instructor Brian Harvey Introduction to programming and computer science. This course exposes students to techniques of abstraction at several levels: (a) within a programming language, using higher-order functions, manifest types, data-directed programming, and message-passing; (b) between programming languages, using functional and rule-based languages as examples. It also relates these techniques to the practical problems of implementation of languages and algorithms on a von Neumann machine. There are several significant programming projects, programmed in a dialect of the LISP language. www.cs.berkeley.edu Category: Education Length: 00:31:34.500 Tags: .

 

---

Lecture 1 | programming abstractions (stanford)

The first lecture by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie Zelenski gives an introduction to the course, recursion, algorithms, dynamic data structures and data abstraction; she also introduced the significance of programming and gives her opinion of what makes 106B "great;" C++ is introduced, too. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:32:17.250 Tags: .

 

---

Lecture 5a | mit 6.001 structure and interpretation, 1986

Assignment, State, and Side-effects Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:56:30 Tags: abstraction recursion .

 

---

Solve sudoku: with recursion and memoization

for real overkill effects, recursively test possibilities in a sudoku puzzle with wide/surround sound track in background Category: Gaming Length: 00:01:30 Tags: .

 

---

Lec 6 | mit 6.00sc introduction to computer science and programming, spring 2011

Lecture 6: Recursion Instructor: Eric Grimson View the complete course: ocw.mit.edu License: Creative Commons BY-NC-SA More information at ocw.mit.edu More courses at ocw.mit.edu Category: Education Length: 00:37:03 Tags: .

 

---

Lecture 14 | programming abstractions (stanford)

Lecture 14 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie starts off with algorithm analysis, the big-O notation and introduces sorting. She begins off with a brief overview of what algorithm analysis is and how to utilize it. Later, she continues to go through recursive algorithms and their uses. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:37:09.750 Tags: .

 

---

Lecture 23 | programming abstractions (stanford)

Lecture 23 by Julie Zelenski for the Programming Abstractions Course (CS106B) in the Stanford Computer Science Department. Julie shows a YouTube video of Barack Obama answering a question about what kind of sorting algorithm he would use to sort a list of data. She also gives several examples of problems that are capable of being solved with sorting. She goes on to say that if you think about certain problems as graphs, finding the solution is sometimes easier as well as easier to understand. To be able to do this, she explains how to represent graphs in C++. Complete Playlist for the Course: www.youtube.com CS 106B Course Website: cs106b.stanford.edu Stanford Center for Professional Development scpd.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:34:23.250 Tags: .

 

---

Neuromancer.

This is more or less the email I sent to a man I love but I'm too afraid to ask him to bend me over his desk and--well, I'm sure that I'm plenty obvious with my attraction. Cheers to brilliant professors who keep you from the darkness within yourself. Also, I apologize for the mistakes I make; I really don't want to record this again. Category: People & Blogs Length: 00:05:22.500 Tags: .

 

---

Advanced topics in programming languages: closures for java

Google Tech Talks January 17, 2007 ABSTRACT We propose to add Closures to the Java Programming Language. Closures simplify the use of APIs that rely on anonymous class instances, such as the concurrency APIs and callbacks. More importantly, closures support control abstractions, which are APIs that act as programmer-defined control constructs. This talk describes the proposed language extension and its design rationale, and shows how it will affect existing and future APIs. Credits: Speaker:Neal Gafter Category: Howto & Style Length: 01:26:18.750 Tags: .

 

---

Y combinatorの謎

もっとも有名な不動点演算子のひとつである Y combinator の謎に迫る。 Category: Education Length: 00:10:41.250 Tags: .

 

---

Gtac 2009 - opening talk

Google Tech Talk October 21, 2009 ABSTRACT Presented by Professor Niklaus Wirth at the 4th Annual Google Test Automation Conference, October 21st, 22nd, 2009, Zurich, CH The activity of testing is as old as programming. We recall the early days of programming, the techniques available at the time, and the introduction of tools for testing and - mainly - debugging. Then we try to compare the old techniques with the modern state of the art, and to critically assess the progress achieved. Bio: Niklaus Wirth was born in February 1934 in Winterthur, Switzerland. He studied electrical engineering at ETH (Federal Institute of Technology) in Zürich, graduated in 1959, received an M.Sc. degree from Laval University in Quebec, and a Ph.D. from the University of California at Berkeley in 1963.Wirth has been an Assistant Professor of Computer Science at Stanford University (1963-67) and, after his return to Switzerland, a Professor of Informatics at ETH from 1968 1999. His principal areas of contribution were programming languages and methodology, software engineering, and design of personal workstations. He has designed the programming languages Algol W (1965), Pascal (1970), Modula-2 (1979), and Oberon (1988), was involved in the methodologies of Structured Programming and Stepwise Refinement, and designed and built the workstations Lilith, with high-resolution display, mouse, and high-level language compiler in 1980, and Ceres in 1986.He has published several text books for ... Category: Science & Technology Length: 00:36:06.750 Tags: google tech talk .

 

---

A tutorial comparing pattern matching and other paradigms (match_sorted.ogv)

This is one of a collection of tutorials demonstrating Pop11, a language with some of the features of Lisp, Scheme, and Prolog, developed for teaching and research in AI and Cognitive Science. This unscripted tutorial turned out longer than intended. It is based on this file, showing the program text demonstrated in the tutorial www.cs.bham.ac.uk Most people think of pattern matching as an operation performed on strings (eg 'grep' in unix/linux). The matching here is on structures, including lists of items, lists of lists, etc. So the functions of matching in this context can be thought of as searching in and extracting information from a database of knowledge rather than finding and manipulating bits of text. Because the tutorial was unscripted there are some bloopers -- eg where I temporarily switched my brain into the wrong context -- eg attempting to trace "matches" in an example that used "doesmatch", not "matches". The tutorial presents a fairly standard recursive algorithm for checking whether a list of numbers is sorted, then shows how that can be replaced by a non-recursive definition using the pop11 pattern matcher, which allows you to specify a sort of abstract picture of what is not allowed in a sorted list. The pop11 matcher compares that picture with an input list, and if it matches, the list is not sorted. This naive use of the matcher is shown to work, but with considerable inefficiency. So a Pop11 library is compiled which allows, instead of the format ... Category: Education Length: 00:36:37.500 Tags: .

 

---

Paul steenhuisen - "between lips and lips there are cities"

Performed by the Nederlands Kamerkoor. Paradoxical, catapulting the listener through rapidly changing and radically different literary materials and a labyrinthine path of compositional techniques, this antiphonal work pushes and pulls its course in the union of form and content. The result is an act of intellectual violence whose primary textual topics are existence, recursion/the infinite, and abstraction, reflected in the other materials through expanding and contracting interval and durational values, symmetrical chords and rhythms, and the displacement and fragmentation of time-points based on the palendromic source-rhythms. The texts were collected from 25 different authors, including writers (Samuel Beckett, Robert Browning, Albert Camus, Lewis Carroll, Douglas Coupland, Jean Genet, Pablo Neruda, Jean-Paul Sartre, Gertrude Stein, Arseniy Tarkovsky and William Carlos Williams), artists (Jenny Holzer, Jasper Johns, Jeff Koons, Richard Long, René Magritte and Andy Warhol), film-makers (Jean-Luc Godard and Wim Wenders), Zen Master Mumon, Parmenides of Elea, Guillaume de Machaut and Steve Martin, as well as an excerpt of text from Gregorian Chant and more. PS © Paul Steenhuisen. All rights reserved. Category: Music Length: 00:03:48 Tags: .

 

---

Lecture 6b | mit 6.001 structure and interpretation, 1986

Streams, Part 2 Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:47:16.500 Tags: abstraction recursion .

 

---

Lecture 21 | programming paradigms (stanford)

Lecture by Professor Jerry Cain for Programming Paradigms (CS107) in the Stanford University Computer Science department. In this lecture, Prof. Cain continues discussing the functional program and the Scheme programming language by focusing upon function pointers. Programming Paradigms (CS107) introduces several programming languages, including C, Assembly, C++, Concurrent Programming, Scheme, and Python. The class aims to teach students how to write code for each of these individual languages and to understand the programming paradigms behind these languages. Complete Playlist for the Course: www.youtube.com CS 107 Course Website: www.CS107.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:37:52.500 Tags: .

 

---

Lecture 10b | mit 6.001 structure and interpretation, 1986

Storage Allocation and Garbage Collection Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:44:12 Tags: abstraction recursion .

 

---

Expressive languages for the jvm

Google Tech Talk July 28, 2010 ABSTRACT Much has been made of having more expressive languages for the JVM. The recent explosion of interest in alternative JVM languages has shown there's a need for something better. But have Scala, Groovy, Fantom achieved this goal? We'll look at two language cases for the JVM: JRuby, which brings Ruby to the JVM; and Mirah, which attempts to implement Ruby's apparent features directly atop JVM types and code. In each case there have been gains and losses. Ruby often provides beautiful abstractions, but sometimes requires odd things of the JVM that influence performance. The dynamic capabilities are incredibly expressive, but we often need more static structure to enforce typing guarantees or integrate with the platform. On top of all this, much of Ruby's dynamism makes it very difficult to optimize on the JVM. Can we get those features in another way? Mirah may be one answer. It takes as a starting point the "apparent features" of Ruby, and as an end point the basic structures of the JVM, and attempts to tie them directly together. With a fairly simple compiler, Mirah can almost mimic the most common Ruby abstractions, but with static typing guarantees and no runtime library requirements. It provides a Ruby-like way to write Java, the ultimate goal of so many JVM languages. In the end, a combination of the two languages probably leads to truth. But what will that combination look like? Charles Oliver Nutter has been programming most of ... Category: Science & Technology Length: 00:44:11.250 Tags: google tech talk .

 

---

Saxually explicit images: data mining large shape databases

Google TechTalks May 12, 2006 Eamonn Keogh ABSTRACT The problem of indexing large collections of time series and images has received much attention in the last decade, however we argue that there is potentially great untapped utility in data mining such collections. Consider the following two concrete examples of problems in data mining. Motif Discovery (duplication detection): Given a large repository of time series or images, find approximately repeated patterns/images. Discord Discovery: Given a large repository of time series or images, find the most unusual time series/image. As we will show, both these problems have applications in fields as diverse as anthropology, crime... Category: Howto & Style Length: 00:38:53.250 Tags: .

 

---

Lecture 25 | programming paradigms (stanford)

Lecture by Professor Jerry Cain for Programming Paradigms (CS107) in the Stanford University Computer Science department. In this lecture, Prof. Cain discusses the Python dictionary and illustrates a small program containing the imperative, object-oriented, and functional paradigms. Programming Paradigms (CS107) introduces several programming languages, including C, Assembly, C++, Concurrent Programming, Scheme, and Python. The class aims to teach students how to write code for each of these individual languages and to understand the programming paradigms behind these languages. Complete Playlist for the Course: www.youtube.com CS 107 Course Website: www.CS107.stanford.edu Stanford University: www.stanford.edu Stanford University Channel on YouTube: www.youtube.com Category: Education Length: 00:36:34.500 Tags: .

 

---

Lec 15 | mit 6.00 introduction to computer science and programming, fall 2008

Lecture 15: Abstract data types, classes and methods Instructors: Prof. Eric Grimson, Prof. John Guttag View the complete course at: ocw.mit.edu License: Creative Commons BY-NC-SA More information at ocw.mit.edu More courses at ocw.mit.edu Category: Education Length: 00:37:48.750 Tags: computer programming problem solving .

 

---

A divine nimbus exhales from head to hoof

three obnubilated masks: Use of models, symbols, diagrams and pictures. Use of abstraction to simplify the effort of thinking. Use of metasyntactic variables to simplify the effort of naming. Use of iteration and recursion to converge on a concept. Limitation of attention to aid concentration and focus on a concept. Use of peace and quiet to aid concentration. Goal setting and goal revision. Simply letting the concept percolate in the subconscious, and waiting for the concept to re-surface. Talking with like-minded people. Resorting to communication with others, if this is allowed. Working backward from the goal. Category: Education Length: 00:04:35.250 Tags: .

 

---

Lecture 8a | mit 6.001 structure and interpretation, 1986

Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:31:23.250 Tags: abstraction recursion .

 

---

Lecture 3b | mit 6.001 structure and interpretation, 1986

Symbolic Differentiation; Quotation Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:33:04.500 Tags: abstraction recursion .

 

---

Lecture 10a | mit 6.001 structure and interpretation, 1986

Compilation Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:34:17.250 Tags: abstraction recursion .

 

---

Lecture 7b | mit 6.001 structure and interpretation, 1986

Metacircular Evaluator, Part 2 Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:45:05.250 Tags: abstraction recursion .

 

---

Lecture 2a | mit 6.001 structure and interpretation, 1986

Higher-order Procedures Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:46:00.750 Tags: abstraction recursion .

 

---

Sketch! by dick ford

SKETCH! is a whirlwind tour through 30 years of the artist-filmmaker's sketch books, drawings, and paintings, revealing an astonishing range of drawing styles. Winner of the 2006 Best Experimental Film Award at Crossroads Film Festival, Jackson MS. SKETCH! includes over a thousand different images selected from tens of thousands of drawings, sketches, and art works all from one artist, Dick Ford. The images span from student work to that of a professional visual artist. There are academic studies from the old masters of western and eastern art traditions, figure drawing studies, rapidly executed sketches of passersby in public spaces, and detailed portraits of close friends and family. Styles range from photographic realism, through gestural inventions, to abstractions of pure form. The film presents a flowing sequence of images leading from one sketch book to another, edited to original music created by the artist in collaboration with his brother, Dennis Ford and son Adam Ford. The rich variety of imagery offers the viewer many surprises along the way as visual ideas generate and develop, change, merge with one another, and evolve into new expressions. Category: Film & Animation Length: 00:05:46.500 Tags: .

 

---

Lecture 5b | mit 6.001 structure and interpretation, 1986

Computational Objects Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:48:23.250 Tags: abstraction recursion .

 

---

Lecture 1b | mit 6.001 structure and interpretation, 1986

Procedures and Processes; Substitution Model Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:43:46.500 Tags: abstraction recursion .

 

---

Lecture 9a | mit 6.001 structure and interpretation, 1986

Register Machines Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:53:57.750 Tags: abstraction recursion .

 

---

Lecture 4a | mit 6.001 structure and interpretation, 1986

Pattern Matching and Rule-based Substitution Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:47:22.500 Tags: abstraction recursion .

 

---

Complex cosmology

Lyrics: there's a nameless thing when i see you the words dont even explain or come close to explaining how i feel when I'm near you I try to speak but in vain and I want to give you the emotional response that i'm thinking of it's not love but it's close enough And I try and I try to think of what to say think of what to say and i tried, and i tried, this is what im trying to say: don't take your glasses off, i wanna see you in your natural state, staring into space thinking "wouldnt it be great if i could harness all the galaxy's energy-- folded into space and time and packaged neatly in a battery and placed inside itself recursively i'd mass produce the sun, charge exhorbitant sums rent a hovercraft for fun, and run the world benevolently" what's that you're reading there is it a book on quantum physics? exquisite! would you ever visit the moon if you could well I would provided it was cheap enough for one, or two.. Did you know that your eyes look just like abstractions of a star's magnetic field made into something real? That's not a line, I made it up on the spot; you just inspired that thought! you just inspired that thought I hope it makes you happy to see me in a different context than youre used to seeing me in Do you I you know what I mean? When I say that I can't fathom the complexities of trying to tell you what I mean when I say that I wanna be near you I don't necessarily mean proximity so what do i mean? when I say what what I say? well I dont know exactly ... Category: Music Length: 00:03:09 Tags: .

 

---

Lecture 8b | mit 6.001 structure and interpretation, 1986

Logic Programming, Part 2 Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:51:33.750 Tags: abstraction recursion .

 

---

Lecture 1a | mit 6.001 structure and interpretation, 1986

Overview and Introduction to Lisp Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:54:42 Tags: abstraction recursion .

 

---

Lecture 6a | mit 6.001 structure and interpretation, 1986

Streams, Part 1 Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:50:12.750 Tags: abstraction recursion .

 

---

Lecture 7a | mit 6.001 structure and interpretation, 1986

Metacircular Evaluator, Part 1 Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 01:03:28.500 Tags: abstraction recursion .

 

---

Lecture 3a | mit 6.001 structure and interpretation, 1986

Henderson Escher Example Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:56:42.750 Tags: abstraction recursion .

 

---

11 dimensional exterior product

I use this diagram as an alternative way of thinking of exterior algebra. Like Picasso's paints, you view the N cube partitioned and from many different angles, in a such way that it reflects the properties of exterior product. Another way to put it, is it's a different shape from higher dimension but got same product as an N-cube. If you remove all sides except the last dimension, you will find a tree-like fractal. The white and black dots corresponds to boson and fermion fields. The area is 11 dimensional "triangles" that together in the pattern makes up an 11-cube. The colors are for entertaining Choice of coordinates: Recursive random 4-powers zig-zag of positive golden ratio exponent. Category: Science & Technology Length: 00:03:49.500 Tags: .

 

---

Lecture 4b | mit 6.001 structure and interpretation, 1986

Generic Operators Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 01:02:45 Tags: abstraction recursion .

 

---

Lecture 9b | mit 6.001 structure and interpretation, 1986

Explicit-control Evaluator Despite the copyright notice on the screen, this course is now offered under a Creative Commons license: BY-NC-SA. Details at ocw.mit.edu Subtitles for this course are provided through the generous assistance of Henry Baker, Hoofar Pourzand, Heather Wood, Aleksejs Truhans, Steven Edwards, George Menhorn, and Mahendra Kumar. Category: Education Length: 00:53:02.250 Tags: abstraction recursion .

 

---

Ice pick makes his point (mark teller) -- part 1 of 3

Your recruiter ("Ice Pick") is full of surprises. Mark Teller shows what it is like to sit in front of a recruiter and: * Hand over your fake resume like it was a million bucks in loose cash; * Not seem desperate to get the job; * Survive a brutal career assessment / career test / career quiz; * Wish you had copied a better cover letter and resume examples out of Screw the Recruiter; * Rise above the other job seekers with your wit and style, and when that fails, through pathetic ass-kissing; and * Realize you are about to make a serious career change with some prickly consequences. www.screwtherecruiter.com Category: Comedy Length: 00:01:43.500 Tags: .

 

---

<< | 1 | >>