VCE ALGORITHMICS (HESS) Unit 4 SCHOOL-ASSESSED COURSEWORK PERFORMANCE DESCRIPTORS DESCRIPTOR: typical performance in each range Mark Range Very Low Low Medium High Very High 1 - 100 Briefly outlines the Describes some of the Describes most of the Describes fully the Describes comprehensively the characteristics of a Turing characteristics of a Turing characteristics of a Turing characteristics of a Turing characteristics of a Turing machine with some errors. machine with few errors. machine. Executes a fixed machine. Creates an machine. Creates an accurate Executes one step of a Turing number of steps of the Turing appropriate representation of and appropriate representation Unit 4 machine. machine. an instruction set for a Turing of an instruction set for a Turing machine, with some errors in machine. Executes a fixed Outcome 3 the representation. Executes a number of steps of the Turing On completion of fixed number of steps of the machine. this unit students Turing machine. should be able to Briefly outlines the Halting Describes some of the core Describes most of the core Describes, using subject-specific Describes comprehensively, explain the scope problem, with some minor characteristics of undecidable characteristics of undecidable language the core using subject-specific language of algorithmics as errors. problems, with few minor problems connected to a characteristics of undecidable the core characteristics of an approach to errors. specific example. problems connected to some undecidable problems and computational examples. explains the implications of problem solving, undecidability. and demonstrate Briefly outlines the goals of Describes the goals of Hilbert’s Describes accurately the goals Describes the of Hilbert’s Describes comprehensively the the universality of Hilbert’s program, with some program and its outcome, with of Hilbert’s program, its program, its outcome, its goals of Hilbert’s program, its computation and minor errors. few minor errors. outcome and its historical historical context and outcome, its historical context its limits using core context. connection to the origin of and connection to the origin of concepts from computer science. Provides an computer science. Provides a theoretical explanation of the implications logical and detailed explanation computer science of the failure of Hilbert’s of the implications of the failure program. of Hilbert’s program.
VCE ALGORITHMICS (HESS) Unit 4 SCHOOL-ASSESSED COURSEWORK PERFORMANCE DESCRIPTORS DESCRIPTOR: typical performance in each range Mark Range Very Low Low Medium High Very High Unit 4 Outcome 3 On completion of this unit students should be able to explain the scope of algorithmics as an approach to computational problem solving, and demonstrate the universality of computation and its limits using core concepts from theoretical computer science 1 - 100 Briefly outlines the characteristics of a Turing machine with some errors. Describes some of the characteristics of a Turing machine with few errors. Executes one step of a Turing machine. Describes most of the characteristics of a Turing machine. Executes a fixed number of steps of the Turing machine. Describes fully the characteristics of a Turing machine. Creates an appropriate representation of an instruction set for a Turing machine, with some errors in the representation. Executes a fixed number of steps of the Turing machine. Describes comprehensively the characteristics of a Turing machine. Creates an accurate and appropriate representation of an instruction set for a Turing machine. Executes a fixed number of steps of the Turing machine. Briefly outlines the Halting problem, with some minor errors. Describes some of the core characteristics of undecidable problems, with few minor errors. Describes most of the core characteristics of undecidable problems connected to a specific example. Describes, using subject-specific language the core characteristics of undecidable problems connected to some examples. Describes comprehensively, using subject-specific language the core characteristics of undecidable problems and explains the implications of undecidability. Briefly outlines the goals of Hilbert’s program, with some minor errors. Describes the goals of Hilbert’s program and its outcome, with few minor errors. Describes accurately the goals of Hilbert’s program, its outcome and its historical context. Describes the of Hilbert’s program, its outcome, its historical context and connection to the origin of computer science. Provides an explanation of the implications of the failure of Hilbert’s program. Describes comprehensively the goals of Hilbert’s program, its outcome, its historical context and connection to the origin of computer science. Provides a logical and detailed explanation of the implications of the failure of Hilbert’s program.