camel

鐃緒申鐃旬でわ申Wired鐃緒申鐃緒申鐃遵げ鐃緒申鐃塾わ申鐃緒申茲�鐃祝なっわ申2,3 Turing Machine鐃叔わ申鐃緒申鐃緒申

鐃緒申鐃塾常申鐃緒申鐃祝￥申Perl鐃緒申鐃夙わ申鐃銃わ申鐃殉わ申鐃夙わ申鐃緒申鐃緒申鐃獣￥申

http://www.wolframscience.com/prizes/tm23/TM23Proof.pdf - 鐃緒申鐃緒申鐃緒申PDF
I have written several Perl programs, to demonstrate the constructions given in the proof and to interpret the systems given in various conjectures.

鐃純え鐃出わ申鐃緒申粉鐃緒申鐃緒申鐃�

cytag.pl 
#!/bin/perl -w 
use strict; 
my $working; 
my @rules; 
my $rulecount=0; 
my $temp; 
my $temp2; 
my $doubling=0; 
# If a Y is given as the first argument, double each element of the output to 
# show the similarity to system 5 
$ARGV[0]eq'Y' and do{$doubling=1; shift @ARGV;}; 
# Read from file 
$ARGV[0]eq'F' and do{ 
    shift @ARGV; 
    my $file = shift @ARGV; 
    local $/ = undef; 
    open INFILE, $file; 
    @ARGV = split(' ',<INFILE>); 
    close INFILE; 
}; 
$|=1; 
# Load the working string 
$working=shift @ARGV; 
chomp $working; 
# Load the rules 
for my $e (@ARGV) 
{ 
    chomp $e; 
    $e eq '""' and $e = ''; 
    $rules[$rulecount++]=$e; 
} 
while($working ne '') 
{ 
    # Remove and print the first element of the working string 
    $temp=substr $working,0,1,''; 
    print $temp; 
    $doubling and print $temp; 
    push @rules, ($temp2 = shift @rules); 
    $temp eq '1' and $working .= $temp2; 
} 
print "\n";

鐃緒申鐃銃のとわ申鐃所、鐃駿ワ申鐃夙プラク鐃銃ワ申鐃緒申的鐃夙はわ申鐃緒申鐃淑わ申鐃殉でわ申(鐃純え鐃緒申 whatever if whenever鐃叔なわ申whenever and whatever鐃夙わ申鐃緒申鐃緒申鐃緒申)鐃緒申鐃淑わ申鐃淑わ申鐃緒申鐃曙い鐃緒申鐃縦醐申鐃緒申的鐃緒申Perl鐃緒申廛鐃緒申鐃緒申鐃淳ング醐申鐃緒申箸鐃緒申鐃緒申鐃緒申鐃緒申薀件申鐃緒申鐃�鐃夙わ申鐃銃使わ申鐃粛わ申多鐃緒申鐃熟わ申辰函屬呂辰鐃緒申磴縁申鐃緒申彌鐃緒申鐃緒申鬚垢鐃塾でわ申鐃緒申鐃緒申鐃春鰹申鐃淑とわ申鐃緒申鐃叔驚わ申鐃緒申鐃銃わ申蕕わ申泙鐃緒申鐃緒申鐃�

鐃緒申鐃緒申鐃緒申鐃緒申鐃夙わ申鐃緒申鐃熟誌申鐃処く鐃緒申鐃殉わ申鐃緒申鐃緒申鐃塾種申鐃緒申鐃緒申鐃叔は￥申鐃緒申某鐃緒申鐃緒申颪�わ申鐃准でわ申鐃粛￥申

鐃出ワ申鐃緒申鬚�にわ申perl鐃夙わ申鐃緒申鐃緒申鐃獣でわ申鐃緒申鐃緒申

Dan the (Math|Perl) Monger

鐃宿居申:Appendix鐃緒申鐃緒申鐃緒申mathematica鐃塾ワ申鐃緒申鐃宿わ申鐃緒申鐃緒申泙鐃緒申鐃�