Jonkman Microblog
  • Login
Show Navigation

  • Public

    • Public
    • Network
    • Groups
    • Popular
    • People

Conversation

Notices

  1. Hattie Cat (hattiecat@quitter.no)'s status on Monday, 15-Jan-2018 00:23:30 EST Hattie Cat Hattie Cat
    Serious question: what (if any) are the implications of Gödel's incompleteness theorems for formal methods to 'prove' a program against a spec. Does it e.g. imply that any spec. can never be complete? Or does it only apply to systems of arithmetic described by axioms?
    In conversation Monday, 15-Jan-2018 00:23:30 EST from quitter.no permalink
  • Help
  • About
  • FAQ
  • TOS
  • Privacy
  • Source
  • Version
  • Contact

Jonkman Microblog is a social network, courtesy of SOBAC Microcomputer Services. It runs on GNU social, version 1.2.0-beta5, available under the GNU Affero General Public License.

Creative Commons Attribution 3.0 All Jonkman Microblog content and data are available under the Creative Commons Attribution 3.0 license.

Switch to desktop site layout.