Universal Machine (ICFP programming contest 2006) - Revision history

Jsummers at 19:53, 6 June 2017

2017-06-06T19:53:38Z

Dan Tobias at 00:20, 3 November 2013

2013-11-03T00:20:22Z

Dan Tobias at 21:56, 2 November 2013

2013-11-02T21:56:18Z

Dan Tobias: /* Format */

2013-11-02T21:19:48Z

‎Format

Dan Tobias: /* Format */

2013-11-02T20:34:35Z

‎Format

Dan Tobias at 20:32, 2 November 2013

2013-11-02T20:32:19Z

Dan Tobias: Created page with "{{FormatInfo |formattype=electronic |subcat=Executables |extensions={{ext|um}}, {{ext|umz}} |released=2006 }} The '''Universal Machine''' was a virtual machine which participa..."

2013-11-02T20:31:43Z

Created page with "{{FormatInfo |formattype=electronic |subcat=Executables |extensions={{ext|um}}, {{ext|umz}} |released=2006 }} The '''Universal Machine''' was a virtual machine which participa..."

New page

{{FormatInfo
|formattype=electronic
|subcat=Executables
|extensions={{ext|um}}, {{ext|umz}}
|released=2006
}}
The '''Universal Machine''' was a virtual machine which participants in the ICFP programming contest of 2006 needed to implement as the first step in a complicated series of programming achievements, each of which unlocked clues about how to proceed from there. This implementation was needed to run programs provided to the participants in .um and .umz files (the latter being self-extracting archives which expanded upon execution in the virtual machine). A detailed spec was given. The machine supposedly duplicated an ancient computing device that operated with sandstone tablets thousands of years ago in ancient Pittsburgh. The contest was hosted by Carnegie Mellon Unversity in Pittsburgh, but participants could be anywhere in the world, submitting their results electronically. The contest is long-finished now, but the materials are still available for anybody who wants to try to solve it.

== Format ==

The Universal Machine is a Turing-complete device that stores 32-bit values on a series of platters, some of which are designated as registers, some as program memory, and some as data storage. Input and output is done a single 8-bit character at a time.

Because it is a 32-bit machine, the files for it consist of sequences of 32-bit (4-byte) values, stored in [[Endianness|big-endian]] fashion. The machine specs designate which bits of a value correspond to program instructions and which are data values or register references that the instruction operates on, for values that are part of a program.

At some point upon correctly implementing the virtual machine and executing the provided program file on it, you'll be asked for a decryption key; during the contest separate keys were assigned to each team, but for the public use of the files now you are supposed to use <code>(\b.bb)(\v.vv)06FHPVboundvarHRAk</code>.

If everything goes well, you'll end up in a [[Unix]]-ish command line shell with access to a filesystem that includes a program in a variety of BASIC that uses only Roman numerals, which needs to be debugged (among other issues, you need to make sure it never produces a value of zero, since there is no Roman numeral for it and thus the program crashes with an error). Solving this will point you to the next task.

== Virtual machine spec ==
* [http://www.boundvariable.org/um-spec.txt The spec is here]

== Sample files ==
* [http://www.boundvariable.org/codex.umz codex.umz]
* [http://www.boundvariable.org/sandmark.umz sandmark.umz]
* [http://www.boundvariable.org/um.um um.um]

== Other links ==
* [http://www.boundvariable.org/ Programming contest main page]
* [http://www.boundvariable.org/task.shtml Task description page with all the info you need to get started]
* [http://www.youtube.com/watch?v=KjLLEMYK5g8 Video (with lots of spoilers if you haven't solved it yet)]

← Older revision		Revision as of 19:53, 6 June 2017
Line 31:		Line 31:

	[[Category:CMU]]		[[Category:CMU]]
−	[[Category:~~Geek humor~~]]	+	[[Category:Humor]]

@@ Line 15: / Line 15: @@
 At some point upon correctly implementing the virtual machine and executing the provided program file on it, you'll be asked for a decryption key; during the contest separate keys were assigned to each team, but for the public use of the files now you are supposed to use <code>(\b.bb)(\v.vv)06FHPVboundvarHRAk</code>.
-If everything goes well, you'll end up in a [[Unix]]-ish command line shell with access to a filesystem that includes a program in a variety of [[BASIC]] that uses only Roman numerals, which needs to be debugged (among other issues, you need to make sure it never produces a value of zero, since there is no Roman numeral for it and thus the program crashes with an error). Solving this will point you to the next task.
+If everything goes well, you'll end up in a [[Unix]]-ish command line shell with access to a [[filesystem]] that includes a program in a variety of [[BASIC]] that uses only [[Roman numerals]], which needs to be debugged (among other issues, you need to make sure it never produces a value of zero, since there is no Roman numeral for it and thus the program crashes with an error). Solving this will point you to the next task.
 == Virtual machine spec ==

← Older revision		Revision as of 20:32, 2 November 2013
Line 29:		Line 29:
	* [http://www.boundvariable.org/task.shtml Task description page with all the info you need to get started]		* [http://www.boundvariable.org/task.shtml Task description page with all the info you need to get started]
	* [http://www.youtube.com/watch?v=KjLLEMYK5g8 Video (with lots of spoilers if you haven't solved it yet)]		* [http://www.youtube.com/watch?v=KjLLEMYK5g8 Video (with lots of spoilers if you haven't solved it yet)]
		+
		+	[[Category:CMU]]
		+	[[Category:Geek humor]]

@@ Line 5: / Line 5: @@
 |released=2006
 }}
-The '''Universal Machine''' was a virtual machine which participants in the ICFP programming contest of 2006 needed to implement as the first step in a complicated series of programming achievements, each of which unlocked clues about how to proceed from there. This implementation was needed to run programs provided to the participants in .um and .umz files (the latter being self-extracting archives which expanded upon execution in the virtual machine). A detailed spec was given. The machine supposedly duplicated an ancient computing device that operated with sandstone tablets thousands of years ago in ancient Pittsburgh. The contest was hosted by Carnegie Mellon Unversity in Pittsburgh, but participants could be anywhere in the world, submitting their results electronically. The contest is long-finished now, but the materials are still available for anybody who wants to try to solve it.
+The '''Universal Machine''' was a virtual machine which participants in the ICFP programming contest of 2006 (Cult of the Bound Variable) needed to implement as the first step in a complicated series of programming achievements, each of which unlocked clues about how to proceed from there. This implementation was needed to run programs provided to the participants in .um and .umz files (the latter being self-extracting archives which expanded upon execution in the virtual machine). A detailed spec was given. The machine supposedly duplicated an ancient computing device that operated with sandstone tablets thousands of years ago in ancient Pittsburgh. The contest was hosted by Carnegie Mellon Unversity in Pittsburgh, but participants could be anywhere in the world, submitting their results electronically. The contest is long-finished now, but the materials are still available for anybody who wants to try to solve it.
 == Format ==

@@ Line 9: / Line 9: @@
 == Format ==
-The Universal Machine is a Turing-complete device that stores 32-bit values on a series of platters, some of which are designated as registers, some as program memory, and some as data storage. Input and output is done a single 8-bit character at a time.
+The Universal Machine is a Turing-complete device that stores 32-bit values on a series of platters, some of which are designated as registers, some as program memory, and some as data storage. Input and output to the outside world is done a single 8-bit character at a time.
 Because it is a 32-bit machine, the files for it consist of sequences of 32-bit (4-byte) values, stored in [[Endianness|big-endian]] fashion. The machine specs designate which bits of a value correspond to program instructions and which are data values or register references that the instruction operates on, for values that are part of a program.