HNHacker News
TopNewBestAskShowJobs

c3poa

1 karma · joined March 8, 2021

submissionscomments
c3poa··on CrabLang
this is funny
c3poa··on It's time for an RSS revival (2018)
Wow, that is my goal now. I'm curious, what RSS readers do use on mobile?
c3poa··on Programming Paradigms, Turing Completeness and Computational Thinking (2020)
Now I understand, thank you for clarification!
c3poa··on Programming Paradigms, Turing Completeness and Computational Thinking (2020)
First, thanks for the answer, really appreciate it!

So in a more practical sense, for example in application programming, unbounded computations/values could be compared to users continually adding/retrieving data against application database - as long as the server is up, the process never stops?

c3poa··on Programming Paradigms, Turing Completeness and Computational Thinking (2020)
> Section 2.3 Turing Completeness and expressiveness: The primary requirement for a TC language is the capacity to describe unbounded computations over unbounded values. This encompasses a very wide spectrum of programming languages, if seemingly novel aspects are regarded as state changes, for example HTML manipulating WWW pages, and SQL manipulating databases. >Contrariwise, a non-TC language can only describe bounded computations, for example regular expressions, or manipulate bounded values, for example FORTRAN IV which, without files, has bounded numbers and arrays. Arbitrary instances of an arbitrary non-TC language will be translatable into an arbitrary TC language but not vice versa.

Can someone elaborate? How do we have unbounded computations and unbounded values?