Effective computation on linear data without random access
No.  Consider an algorithm on a graph (e.g., network flow).  It fundamentally requires random access to memory.  The restriction you propose would be painful and make many standard algorithms impossible.