Conference of interest to the fault-tolerant crowd (hm, wording not quite right):<\/p>\n
Event Title: Workshop on Logical Aspects of Fault Tolerance (LAFT)
\n(affiliated with LICS 2009)
\nDate: 08\/15\/2009
\nLocation: University of California, Los Angeles
\nDescription:
\nWe are soliciting papers on logical aspects of fault tolerance. The concept of
\n“fault” underlies essentially all computational systems that have any goal.
\nLoosely speaking, a fault is an unintended event that can have an unintended
\neffect on the attainment of that goal. “Fault tolerance” is the term given to a
\nsystem’s ability to cope in some way with a fault, either inherently or through
\ndesign. Fault tolerance has been studied for its application to circuits, and then
\nbranching out to distributed systems and more recently to quantum computers, where
\nthe concern with fault tolerance is almost the paramount issue. The relevance to
\nbiological computation is also obvious. Papers must be concerned with mathematical
\nlogical approaches to fault tolerance, not simply fault tolerance.
\nSelected papers will appear in Logic Journal of the IGPL (Oxford U. Press).
\nIMPORTANT DATES:
\nPapers due: April 17, 2009
\nNotification: May 22, 2009
\nFinal papers: July 10, 2009
\nWorkshop: August 15, 2009 <\/p><\/blockquote>\n","protected":false},"excerpt":{"rendered":"
Conference of interest to the fault-tolerant crowd (hm, wording not quite right): Event Title: Workshop on Logical Aspects of Fault Tolerance (LAFT) (affiliated with LICS 2009) Date: 08\/15\/2009 Location: University of California, Los Angeles Description: We are soliciting papers on logical aspects of fault tolerance. The concept of “fault” underlies essentially all computational systems that … <\/p>\n
Continue reading “Fault Tolerance – It's No LAFTing Matter”<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"_jetpack_memberships_contains_paid_content":false,"footnotes":"","jetpack_publicize_message":"","jetpack_publicize_feature_enabled":true,"jetpack_social_post_already_shared":false,"jetpack_social_options":{"image_generator_settings":{"template":"highway","default_image_id":0,"font":"","enabled":false},"version":2}},"categories":[20,65],"tags":[],"class_list":["post-2217","post","type-post","status-publish","format-standard","hentry","category-computer-science","category-quantum-computing"],"jetpack_publicize_connections":[],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"_links":{"self":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/2217","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/comments?post=2217"}],"version-history":[{"count":0,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/posts\/2217\/revisions"}],"wp:attachment":[{"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/media?parent=2217"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/categories?post=2217"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/dabacon.org\/pontiff\/wp-json\/wp\/v2\/tags?post=2217"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}