Changes between Version 2 and Version 3 of EducationalAssignments/SecureTuringCompleteSandboxChallengeBuild

Changes between Version 2 and Version 3 of EducationalAssignments/SecureTuringCompleteSandboxChallengeBuild

Please note that these Trac pages are no longer being updated. Wiki contents/documentation have moved to GitHub.

Changes between Version 2 and Version 3 of EducationalAssignments/SecureTuringCompleteSandboxChallengeBuild

Please note that these Trac pages are no longer being updated. Wiki contents/documentation have moved to GitHub.

Changes between Version 2 and Version 3 of EducationalAssignments/SecureTuringCompleteSandboxChallengeBuild

Show
Ignore:
Timestamp:
08/29/12 19:05:40 (7 years ago)
Author:
justinc
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • EducationalAssignments/SecureTuringCompleteSandboxChallengeBuild

    v2 v3  
    1010---- 
    1111 
    12 Put intuitively, a turing complete sandbox (with infinite memory) can be used to compute any computable problem.   For our purposes, such a sandbox can make several simplifying assumptions that are common for many systems: 
     12Put intuitively, a turing complete sandbox (with infinite memory) can be used to compute any computable problem.   A turing complete sandbox takes a program and data as input.   (The program and data can be stored in the same area or separate ones.)   Any turing complete sandbox can compute any problem that can be computed by any other sandbox. 
     13 
     14Your sandbox only needs to handle computation.   If you elect, you can support some form of I/O, but apart from having a mechanism to provide an initial program and data, this is not required except as specified below. 
     15 
     16For our purposes, such a sandbox can make several simplifying assumptions that are common for many systems: 
    1317 
    1418 1. The amount of memory can be restricted to a specific value.   This is common for assembly language, C code, or byte code interpreters (like the JVM).