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 »
Users Search
Help Dashboard Sign In Sign Up
Challenges Q&A Sandbox Meta
Sandbox
Posts Tags Edits
Create Draft

Comments on Largest finite output

Post

Largest finite output

+0
−0

Your goal is to output the longest finite string of data, with known length (no RNG!)

Your score is $outputlen/bytecount$, competing on a per-language basis. Specify the byte count, output length in bytes, and final score in your answer's header.

code-golf alternative-scoring
posted almost 4 years ago
CC0
user card
moony‭
554 reputation 10 6 68 43
History
Why does this post require attention from curators or moderators?
You might want to add some details to your flag.

1 comment thread

General comments (3 comments)
General comments
Quintec‭ wrote almost 4 years ago
copy link

I don't know about this... doesn't this tend to infinity? Say in python, print 'x'*10000000... each zero is ten times the length yet only +1 byte

moony‭ wrote almost 4 years ago
copy link

@Quintec it does! That's actually a very inefficient answer though. Would be smarter to try and do, say, TREE(3) iterations of an output. Maybe take the logarithm base 10 of the output, though.

Hakerh400‭ wrote almost 4 years ago
copy link

Computing the length of the longest finite output is called the Busy beaver function. It grows faster than any computable function. Even if you take the logarithm of the output length, or super-logarithm, or divide it by Ackermann function, or any other computable postprocessing, the quotient outputlen/bytecount still tends to infinity.