BuK-Übung02 G2

Aus ProgrammingWiki

Archivierte Version vom 2011-03-28T21:07:48+00:00. Aktuelle Version

Intuitiver Berechnbarkeitsbegriff

(define haelt-fuer-n?
  (λ (f n)
    (if (integer? (f n))
        #t
        #f)))

(define haelt?
  (λ (f)
    (haelt-fuer-n? f 0)))

(define crazy
  (λ (n)
    (if (haelt? crazy n)
        (crazy n)
        n)))

(define haelt-tricky?
  (λ (f timeout)
    (letrec 
        ([ft (thread f)]
         [helper
          (λ (timeLeft)
            (if (thread-running? ft)
                (if (= timeLeft 0)
                    #f
                    (begin (sleep 1) (helper (- timeLeft 1))))
                #t))])
      (helper timeout))))

(define test1
  (λ ()
    (print "hallo")))

(define test2
  (λ ()
    (test2)))

(haelt-tricky? test1 10)

(haelt-tricky? test2 10)

Bijektive Funktion

Es sei eine Funktion f:{\mathbb{N}}^{+} \rightarrow {\mathbb{Q}}^{+} gegeben:

f(n) = \left\{\begin{matrix} 1, & \mbox{wenn } n=1 \mbox{,}\\ f(\frac{n}{2})+1, & \mbox{wenn } n \mbox{ gerade,}\\ \frac{1}{f(n-1)}, & \mbox{wenn } n \mbox{ ungerade.} \end{matrix}\right.

BuK-Übung02 G2

Intuitiver Berechnbarkeitsbegriff

Bijektive Funktion

Suche