This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python3 -O | |
""" | |
This module provides an easy way to aggregate citations. | |
A citation is considered to be a single line comment of two or three values | |
seperated by semicolons. If only two values appear it is interpreted as a URL | |
followed by a date. If three values appear it is interpreted as a name | |
followed by a URL and then a date. |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python | |
""" | |
This is a simple cryptography library that has some basic encryption | |
decryption functionality. | |
""" | |
# The MIT License (MIT) | |
# | |
# Copyright (c) 2016 Dylan Robert Ashley |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
""" | |
This module provides a simple logging system. | |
""" | |
# The MIT License (MIT) | |
# | |
# Copyright (c) 2016 Dylan Robert Ashley | |
# | |
# Permission is hereby granted, free of charge, to any person obtaining a copy |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#!/usr/bin/env python3 | |
''' | |
This program attempts to determine the optimal choice when faced with | |
the Monty Hall problem. It does this by simulating the player making | |
the decision to change the door they selected and the player making the | |
decision not to change the door they selected. It does this one hundred | |
thousand times for each choice. It then returns the estimated | |
probability of winning given their decision. | |
''' |