This is an archived snapshot of W3C's public bugzilla bug tracker, decommissioned in April 2019. Please see the home page for more details.

Bug 342 - Turing complete or not turing complete
Summary: Turing complete or not turing complete
Status: RESOLVED FIXED
Alias: None
Product: WS Choreography
Classification: Unclassified
Component: Requirements (show other bugs)
Version: unspecified
Hardware: All other
: P2 major
Target Milestone: --
Assignee: Steve Ross-Talbot
QA Contact:
URL:
Whiteboard:
Keywords:
: 476 (view as bug list)
Depends on: 306
Blocks:
  Show dependency tree / graph
 
Reported: 2003-09-16 19:01 UTC by Steve Ross-Talbot
Modified: 2004-03-04 11:01 UTC (History)
1 user (show)

See Also:

Attachments

Description Steve Ross-Talbot 2003-09-16 19:01:37 UTC 
The issue is that the choreography working group needs to resolve the notion of turing 
completeness. 

The issue revolves around two things.

Firstly is it possible to describe the external observable behaviour for all choreographies without 
the need to use any conditional logic?

Secondly does a choreography need to be executable in a program execution sense (in which case 
turing completness is necessary).
Comment 1 Greg Ritzinger 2004-01-20 17:34:01 UTC 
*** Bug 476 has been marked as a duplicate of this bug. ***
Comment 2 Martin Chapman 2004-03-04 06:01:42 UTC 
there is a requirement for conditional logic in C-CR-4510.
there is not a requirement for executablity