# SICP Study Group Section 1.2 - Online

• Mar 24, 2014 · 7:00 PM
• This location is shown only to members

This is an online meetup to discuss SICP section 1.2.  If you aren't able to make it to either of the in-person meetups, please join in!

• ##### Paul S.

A trimmed version of the discussion is now available on YouTube. There are a few technical glitches at the beginning (where I discover that my webcam's audio cuts out when I switch from its video stream to screen sharing), but everything should be pretty smooth after that.

http://youtu.be/QoE_a4Ss8Ek

May 25, 2014

• ##### Paul S.

Link to join as a hangout participant:

http://youtu.be/642sWl4wF8w

March 24, 2014

• ##### Paul S.

As a reminder, I have my solutions to the section 1.2 exercises posted on GitHub, if you want to refer to them yourself during the discussion. They've been updated since I posted them on the list, so there are solutions for everything but 1.14 and 1.20. Transcribing proofs is a pain!

Source (text, with org-mode formatting; GitHub actually renders everything pretty well as HTML, except for the LaTeX): https://github.com/pataprogramming/sicp-exercises/blob/master/exercises-1.2.org

If you get a chance, please post your own solutions if you have then in a format suitable for sharing.

1 · March 24, 2014

• ##### Tom C.

Hey everyone, I'm on the waitlist for this one so according to Paul's email I'll be in listen-only mode, so I figured I'd put this here to increase the chances of this topic coming up tomorrow:
I've been struggling with making recursive processes into iterative processes. I understand the difference and the recursive processes are generally not too hard to figure out (at least so far...) but making them iterative has been stumping me. I know that I want to take the state that would be 'stacked' in a recursive process and put it into the parameters, but when I actually try to make that modification I run in to trouble. Does any have a technique they use for these problems? Exercise 1.18 is a good example of this.

March 23, 2014

• ##### Michael R.

Look at it as rolling your own for loop, where the degenerate cases are break statements and the recursive call is a continue (goto the top of the loop) statement. At least one of the state variables has to change toward the degenerate case. The others track the calculation (the goal of the function).

March 23, 2014

• ##### Paul S.

We'll definitely make sure this gets discussed. We'll have to see what the Hangouts On Line tools look like, but I hope that there's the possibility of text chat, even if everyone can't participate via video/audio.

March 24, 2014

### 10 went

• ##### Tom C.
• A former member
• A former member

### Wayne, PA

Founded Dec 20, 2012

#### Organizers:

• ##### Relay Network, LLC

Pizza and a Venue

• ##### RJMetrics

Delicious Jams, Jellies (oh, and Pizza)!

• ##### Monetate

Speaker and Member Perks

• ##### SmartStream Tech

Location, food

• ##### FIS

FIS Advanced Technology: Providing food to hungry Clojure programmers.

#### People in this Meetup are also in:

• ##### HackerNest Philadelphia Tech Socials

279 technologists

• ##### Big Data Developers in Philadelphia

1,775 Members

• ##### Tech in Motion: Philadelphia

4,759 Technologists

• ##### Philly PostgreSQL User Group

674 Database Users

• ##### The Philadelphia Python Users Group (PhillyPUG)

2,072 Pythonistas