Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Sandbox

Comments on From the smallest seed

Post

From the smallest seed

+4
−0

Challenge

It's a bootstrapping challenge this time! Write a full program that, once run, writes the source code of another program that in turn, once run, writes the source code for another program, ad infinitum.

However, you can't just do a quine. The length of each program must tend toward infinity as the sequence continues. While you can have programs that create smaller programs within the sequence, the overall trend must tend towards infinity.

Your score is the length of the initial program. This is code golf, so the lowest score wins!

History
Why does this post require attention from curators or moderators?
You might want to add some details to your flag.

2 comment threads

How do we test it? (2 comments)
Some questions (2 comments)
How do we test it?
Lundin‭ wrote over 2 years ago

Testing the original program is easy enough, but how do we test that an infinite amount of programs are unique? It seems that this would be a challenge where lots of people claim to have solved it, and then upon closer investigation perhaps they haven't. With a finite amount of programs created, it would be easier to verify.

Moshi‭ wrote over 2 years ago

I mean, you can say that about any infinite challenge. I suppose though that I could also require a proof that the programs solve the challenge.