Bits to bitcoin : (Record no. 73552)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 05201nam a2200565 i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 8555180 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20220712204923.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 181218s2018 mau ob 001 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9780262346498 |
| -- | electronic bk. |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | electronic bk. |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | hardcover |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| -- | hardcover |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 004 |
| 100 1# - AUTHOR NAME | |
| Author | Day, Mark Stuart, |
| 245 10 - TITLE STATEMENT | |
| Title | Bits to bitcoin : |
| Sub Title | how our digital stuff works / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | 1 PDF (368 pages). |
| 500 ## - GENERAL NOTE | |
| Remark 1 | Includes index. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | Intro; Contents; Preface; Acknowledgments; 1 -- Introduction; I -- Single Process; 2 -- Steps; Bits; Noise; Is Computation Physical?; Weighing Programs; Analog/Digital Conversion; Born Digital; 3 -- Processes; Reading as a Process; Turing Machines; Infinite Processes; Execution; Effective Construction; Hardware vs -- Software; Uniformity Gives Speed; Moore's Law and Uniformity; 4 -- Names; What's in a Name?; Quoting; Sentence Patterns; Lambda; 5 -- Recursion; Factorial; The House That Jack Built; Finite and Infinite; 6 -- Limits: Imperfect Programs; All Software Is Flawed; Discrete States; Testing. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Remark 2 | Massive ScaleDoubling; Branching; Malleability; Making Things Worse; Requirements; Expressing Requirements; Specifications; Mock-ups; Implementation; 7 -- Limits: Perfect Programs; Environment; Big Problems; Computational Complexity; Ignoring Constants; Categories of Complexity; Uncomputability; Formal Logic; No Solution to Hilbert's Problem; Russell's Paradox; Halting vs -- Diverging; Building a Paradox; The Halting Problem; II -- Interacting Processes; 8 -- Coordination; Sharing a Book; Multiple Books and Multiple Readers; Deadlock; Gridlock; Detecting Deadlock; Breaking Deadlock; Livelock. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Remark 2 | Thrashing9 -- State, Change, and Equality; Stateless vs -- Stateful; Assignment; Referential Transparency; Is State Necessary?; Two Kinds of Equal; Same Object vs -- Different Object; 10 -- Controlled Access; Lost Update; Two Processes, in Detail; Interleaving; Multiprocessing and Multiprogramming; Some Example Interleavings; Is This a Real Problem?; Mutual Exclusion; Using a Lock; 11 -- Interrupts; The Unpredictable Environment; Check, Check, Check ... ; Interrupts and Handlers; Shared Services; Frequent Check, Rare Problem; Protecting Memory; System Calls; 12 -- Virtualization; Managing Storage. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Remark 2 | Virtual MemoryVirtual Addresses and Real Addresses; Virtual Machines; Sharing Servers; Building a Hypervisor; 13 -- Separation; Distributed Systems; Autonomy; Distance; Standards; Distance Revisited; Light Is Slow; Is Anyone There?; The Order of Events; Reaching Agreement; Heartbeats; Are Earth-Size Distances Small?; 14 -- Packets; Compression; Incompressible Data; 15 -- Browsing; Programs in Browsers; Naming Resources; Hierarchical Names; Shorter Names; Editing URLs; Naming Servers; Finding Servers; Caching; Talking to the Server; Structure vs -- Presentation; Forms; Escaping; Searching Searches. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Remark 2 | III -- Unstoppable Processes16 -- Failure; Reliability vs -- Availability; Fail-Stop; Spares; Error Correction; Error Detection; Storage and Failure; Flash; Injury vs -- Death; Logging vs -- Replication; Stable Storage; RAID; Independent Failures?; Common-Mode Failure; Failure Rates; 17 -- Software Failure; Specifications Revisited; Consistent Comparison; Comparing Results; Byzantine Failure; 18 -- Reliable Networks; Guaranteed Delivery?; Redundant Messages; The End-to-End Principle; Acknowledgment and Retransmission; Multiple Acknowledgments and Negative Acknowledgments; Congestion Collapse. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | An accessible guide to our digital infrastructure, explaining the basics of operating systems, networks, security, and other topics for the general reader. |
| 700 1# - AUTHOR 2 | |
| Author 2 | Jennings, C. A., |
| 856 42 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | https://ieeexplore.ieee.org/xpl/bkabstractplus.jsp?bkn=8555180 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cambridge, Massachusetts : |
| -- | MIT Press, |
| -- | [2018] |
| 264 #2 - | |
| -- | [Piscataqay, New Jersey] : |
| -- | IEEE Xplore, |
| -- | [2018] |
| 336 ## - | |
| -- | text |
| -- | rdacontent |
| 337 ## - | |
| -- | electronic |
| -- | isbdmedia |
| 338 ## - | |
| -- | online resource |
| -- | rdacarrier |
| 588 ## - | |
| -- | Description based on print version record. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science |
| 650 #7 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
No items available.