Unbounded Spigot Algorithms for the Digits of Pi

2017/03/27(月)19:00 〜 20:00 開催
ブックマーク

イベント内容

Language / 言語

This seminar will be held in English only. / 今回のセミナーは英語での進行となります。

Speaker

Jeremy Gibbons (Oxford University)

Summary

Rabinowitz and Wagon presented a spigot algorithm for computing the digits of π. A spigot algorithm yields its outputs incrementally, and does not reuse them after producing them. Rabinowitz and Wagon’s algorithm is inherently bounded; it requires a commitment in advance to the number of digits to be computed. We propose some streaming algorithms based on the same and some similar characterizations of π, with the same incremental properties, but without requiring the prior bound. They are nice examples of lazy functional programming, and instances of a more general scheme for streaming computation.

Date and Time

  • 2017-3-27 (Mon) 19:00 (The registration desk opens at 18:45)

Place

Read before comming

Registration

  • Registration is required to enter the office floor of the building. A registration desk for the seminar participants will be located on the second floor of the building. Please state your name to the staff and receive a visitor card key.
  • The registration desk will be opening around 15 minutes before the seminar starts.
  • If you've arrived at the building after the registration desk has closed, please call the phone number printed on the signboard at the registration desk.

Leaving

  • We will collect your visitor card key before you leave the meeting room. Please hand your key to the staff standing by the room exit.

注意事項

※ こちらのイベント情報は、外部サイトから取得した情報を掲載しています。
※ 掲載タイミングや更新頻度によっては、情報提供元ページの内容と差異が発生しますので予めご了承ください。
※ 最新情報の確認や参加申込手続き、イベントに関するお問い合わせ等は情報提供元ページにてお願いします。

関連するイベント