Scribd
Upload
34 views3 pages

2.1 Some Theorems and Stuff: Lecture 2: November 5

The document summarizes the key topics from Lecture 2 on November 5th, including lemmas, theorems, definitions, figures, and exercises. It introduces Lemma 2.1 and Theorem 2.2, defines several terms, and includes Figure 2.1 and 2.2 to illustrate concepts. It also presents pseudocode for the makelabeli algorithm and concludes with three exercises.

Uploaded by

alex.liberzon2984
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views3 pages

2.1 Some Theorems and Stuff: Lecture 2: November 5

The document summarizes the key topics from Lecture 2 on November 5th, including lemmas, theorems, definitions, figures, and exercises. It introduces Lemma 2.1 and Theorem 2.2, defines several terms, and includes Figure 2.1 and 2.2 to illustrate concepts. It also presents pseudocode for the makelabeli algorithm and concludes with three exercises.

Uploaded by

alex.liberzon2984
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Computational Learning Theory

Fall Semester, 1992/3

Lecture 2: November 5
Lecturer: Yishay Mansour

2.1

Scribe: Itzi Rozenscriber

Some theorems and stu

We now delve right into the proof.


Lemma 2.1 This is the first lemma of the lecture.
2

Proof: The proof is by induction on . . .


Theorem 2.2 This is the first theorem.
Proof: This is the proof of the first theorem theorem.

2.1.1

A few items of note

Here is an itemized list:


this is the first item
this is the second item

2.1.2

A few more items

Here is an enumerated list:


1. this is the first item
2. this is the second item

2.2

Next topic

We are now ready for a major definition.


Definition This is the definition of myword.
Corollary 2.3 This is a corollary following from the definition of myword.
Sometimes we define terms in the middle of a paragraph. This is a dierent term being
defined. Wasnt that easy?
On to the next page:
1

Lecture 2: November 5



HH

HH

HH


HH

HH




U ...


@
@
@
@
@




@
@
@
@
@



U ...



@
@
@
@
@
@
   

...

...

   



U ...


@
@
@
 

a ...

 

Figure 2.1: This is my picture.


This can be seen in Figure ??. Note that latex actually places this text before the figure,
even though it appears after the figure in the .tex file.

Figure 2.2: This is a new picture.

2.3. EXERCISES

3
fulli (h), h {1. . . n 1}
begin
if numvi (max , h) n h
then return (true)
else return (false)
end full

makelabeli
begin
if i = imax
then h := minimum h such that full(h) = true

xi := nextlabel(max , h )
end makelabeli

Figure 2.3: Code for makelabeli of bctss


.

2.3

Exercises

1. Kama-kama yatzaa Hapoel Beer-Sheva mul Makabee Tel-Aviv be-onat 82?


*2. Tanin hu yoter aroch o yoter yarok?
*3. Ma shem hamishpacha shel ha-denni sh-amar: 2B 2B.

You might also like