Radio Computing • Internet and Co • Programming with Stair • Sorting and Searching (Previous | Next)

Internet and Co deals with some aspects of the future internet: How can examinations be conducted with the aid of the internet? How can an identification (number), the ID, assigned uniquely to each person, usefully be applied in connection with the internet? What types of content will be on the internet? How can information user profiles simplify search processes on the internet?

What tasks could a multifunction device called strap fulfil? What can modern clothes achieve (for deafblind people)? How can virtual reality be realised (in rooms and in the brain)? How can goods be transported quickly in future? What are the consequences for professions in the future? What must be in future considered for intelligent machines?

Programming with Stair presents a programming concept for development environments, with which source codes can be converted into ones of other programming languages, or rule-based into freely chosen notations. The programming language Clare provided in it is capable of learning (by adding rules and meta-rules) and has activatable (self-) optimisation algorithms that adapt themselves nearer the time to the individual circumstances.

Below sorting and searching an O(1)-sorting algorithm with two steps is presented if the hardware is not limited. This procedure is adapted to different real conditions. By simple hardware adaption (organisation of memory locations preferably as tree of degree 2t with natural t) an O(n)-procedure (bitsort) can be specified for n successively read input values. Furthermore is described how one can fast index and search in O(1).

Radio computing enables, by simultaneous radioing on different frequencies, parallel computing through parallel communication of each memory cell with each other one. Thus, n values can be sorted in O(1), the indexing of database tables becomes widely obsolete. Networking and cloud computing solve with radio technology various problems much faster than before, what can be accessed comfortably at home.

L can solve all problems of any world in a higher world at one go by singling out those from all possible solutions with recording the solution formations by (comparative) sorting that satisfy the solution criteria. On substantial comparisons can largely be foregone by gödelisation. Consequently, all problems are for zer in the same complexity class O(1).

Ze does not get around the formation of all possibilities, since crucial problems are irreducible in terms of complexity. For our (finite) world, this means that in it crucial problems are not solvable. This does not mean, however, that we cannot solve the problems important for us, but only, that we cannot answer all scientific questions.

Theorem: All problems of a finite world can be solved in O(1).

Proof: Conditions are checked by inserting the complete solution space into the conditions at once, possibly by parallel processing. Calculations are accelerated by summarising calculation steps. Continued summarising yields an overall calculation step. Hence the claim follows, since every finite solution space can also be constructed in one step.

© 2006-2011 by Boris Haase

• disclaimer • mail@boris-haase.de • pdf-version • bibliography • subjects • definitions • statistics • php-code • rss-feed • top