Space to Think

+
Problems Rules
Wish / ProblemWhy?

    [Results]"I wish this thing be like that..."

  • 0
    |   Writing flexible reusable software Writing software that does a thing is fairly straightforward. Writing software that can adapt to change is difficult. It's challenging to write software that can be easily customised. It's a completely different approach to build adaptable software
  • 0
    |   Web technologies too hard to implement A web browser is so complicated that there are over 1200 specs to understand to implement a conforming web browser
  • 0
    |   Code complexity and poor interoperability Addition, calculation, algorithms takes an incredibly small portion of actual code. Most code is unnecessarily there to satisfy the compiler with interoperability of methods, arranging data structures and configuration
  • see more..

Ideas Rules
Method / PrincipleHow?

    [Results]"I found a way this could work..."

  • +2
      URL powered computer :  Installing software is so 1990s-2000s. Let's configure and install software by giving URLs or taking them away. Everything is a URL
  • 0
      Can A* be used to generate algorithm sourcecode? :  I thought of an idea to use a* algorithm to "walk" toward a solution that solves a programming problem. Each neighbour can be a weighted list of programming tasks such as if statement, for each, assignment, recursive call. How do you map example data structures transformations to code that fulfils the changes to the data structure? You need a cost function that decreases when the output gets nearer to the solution. What does the cost function for code solving a problem look similar to?
  • 0
      Stack pattern match :  Imagine you have a reference implementation of a btree and a reference implementation of a locking manager and a security manager and you want to tie them together. You could add code calls from one to the other but what if there is a better way? The better way for extensibility is to match stack function calldepths to code snippets that run whenever the pattern is matched. For example when a btree is split you might want to acquire locks or release locks in a certain order. We can do pattern matching around the callsite of a btree split and return values and do the right locking and security behaviours without needing to change the API of either. Essentially you have parallel multiple return values.
  • see more..

+
Development Rules
Work / ActivityWhat?

    [Results]"Here's what I did, and will do next..."

    see more..

+
Products
Outlets / EndpointsWhere?

+
Persons
Identities / BrandsWho?

+
Stories
News / ReportsWhen?

ago @ Benefitting everybody as much as possible

How can we benefit everybody as much as possible? I really don't … (expand)

[reply]

Deepak

ago @ Partial Space Elevator

Two points: We can start rolling out the lightest part of it … (expand)

[reply]

Mindey

ago @ Benefitting everybody as much as possible

I think this might be a bad aim for individuals. For example, … (expand)

[reply]

Samuel

ago @ Personalized Diet

I think this might be more complicated than keeping a diary or … (expand)

[reply]

Samuel

ago @ HiveCell

When I realize that the incessant cleaning of surfaces in Japan is … (expand)

[reply]

Mindey