< Idea and execution: a simple factorization

Uplinks: 




  
  
daily-catch
  
  
  
2023
  
  

{
  "config": {
    "base_url": "http://dmitry.cheryasov.info",
    "mode": "build",
    "title": null,
    "description": null,
    "languages": {},
    "default_language": "en",
    "generate_feed": false,
    "feed_filename": "atom.xml",
    "taxonomies": [
      {
        "name": "tag",
        "slug": "tag",
        "paginate_by": null,
        "paginate_path": null,
        "render": true,
        "feed": true
      }
    ],
    "author": null,
    "build_search_index": false,
    "extra": {},
    "markdown": {
      "highlight_code": false,
      "highlight_theme": "base16-ocean-dark",
      "highlight_themes_css": [],
      "render_emoji": false,
      "external_links_target_blank": false,
      "external_links_no_follow": false,
      "external_links_no_referrer": false,
      "smart_punctuation": false,
      "extra_syntaxes_and_themes": [],
      "lazy_async_image": false
    },
    "search": {
      "index_format": "elasticlunr_javascript"
    }
  },
  "current_path": "/daily-catch/2023/idea-execution-factorization/",
  "current_url": "http://dmitry.cheryasov.info/daily-catch/2023/idea-execution-factorization/",
  "lang": "en",
  "page": {
    "relative_path": "daily-catch/2023/2023-01-02-idea-execution-factorization.md",
    "colocated_path": null,
    "content": "
Idea and Execution as two factors of the ultimate gain. Idea's worth grows linearly, execution's, exponentilly.
\n
A poor idea reasonably has a negative worth.
\n",
    "permalink": "http://dmitry.cheryasov.info/daily-catch/2023/idea-execution-factorization/",
    "slug": "idea-execution-factorization",
    "ancestors": [
      "_index.md",
      "daily-catch/_index.md"
    ],
    "title": "Idea and execution: a simple factorization",
    "description": null,
    "updated": null,
    "date": "2023-01-02",
    "year": 2023,
    "month": 1,
    "day": 2,
    "taxonomies": {
      "tag": [
        "business",
        "simplicity",
        "symbolic"
      ]
    },
    "authors": [],
    "extra": {},
    "path": "/daily-catch/2023/idea-execution-factorization/",
    "components": [
      "daily-catch",
      "2023",
      "idea-execution-factorization"
    ],
    "summary": null,
    "toc": [],
    "word_count": 29,
    "reading_time": 1,
    "assets": [],
    "draft": false,
    "lang": "en",
    "lower": {
      "relative_path": "daily-catch/2023/2023-12-06-p-language-for-distributed-fsm.md",
      "colocated_path": null,
      "content": "
The P language:
\n
\n
Describes a distributed system as a bunch of FSMs.
\n
Verifies its correctness to some degree (but not proves yet).
\n
Generates C or C# code; compact enough to suit even device drivers.
\n
Allows to describe test suites and monitoring tools for the code.
\n
MIT license.
\n
\n
Sumbitted to HN; got to the front page briefly.
\n",
      "permalink": "http://dmitry.cheryasov.info/daily-catch/2023/p-language-for-distributed-fsm/",
      "slug": "p-language-for-distributed-fsm",
      "ancestors": [
        "_index.md",
        "daily-catch/_index.md"
      ],
      "title": "P language: distributed state machines",
      "description": null,
      "updated": null,
      "date": "2023-12-06",
      "year": 2023,
      "month": 12,
      "day": 6,
      "taxonomies": {
        "tag": [
          "programming",
          "distributed"
        ]
      },
      "authors": [],
      "extra": {},
      "path": "/daily-catch/2023/p-language-for-distributed-fsm/",
      "components": [
        "daily-catch",
        "2023",
        "p-language-for-distributed-fsm"
      ],
      "summary": null,
      "toc": [],
      "word_count": 66,
      "reading_time": 1,
      "assets": [],
      "draft": false,
      "lang": "en",
      "lower": null,
      "higher": null,
      "translations": [],
      "backlinks": []
    },
    "higher": {
      "relative_path": "daily-catch/2022/2022-12-28-kopia-backup-software.md",
      "colocated_path": null,
      "content": "
Kopia: the approach is approach similar to Restic, but apparently works faster.
\n
\n
Like Restic and Borg, a chunk-based, incremental, encrypted backup to object stores (S3, S2, etc), can mount a backup as an FS.
\n
Various properties of the backup are determined by a policy that lives in the backup repository.
\n
A single binary, implemented in Go.
\n
Unlike Restic, has an official GUI. Unlike Borg, works well on Windows, too.
\n
\n",
      "permalink": "http://dmitry.cheryasov.info/daily-catch/2022/kopia-backup-software/",
      "slug": "kopia-backup-software",
      "ancestors": [
        "_index.md",
        "daily-catch/_index.md"
      ],
      "title": "Kopia backup software",
      "description": null,
      "updated": null,
      "date": "2022-12-28",
      "year": 2022,
      "month": 12,
      "day": 28,
      "taxonomies": {
        "tag": [
          "backup",
          "open source",
          "software"
        ]
      },
      "authors": [],
      "extra": {},
      "path": "/daily-catch/2022/kopia-backup-software/",
      "components": [
        "daily-catch",
        "2022",
        "kopia-backup-software"
      ],
      "summary": null,
      "toc": [],
      "word_count": 76,
      "reading_time": 1,
      "assets": [],
      "draft": false,
      "lang": "en",
      "lower": null,
      "higher": null,
      "translations": [],
      "backlinks": []
    },
    "translations": [],
    "backlinks": []
  }
}