# Tag Info

6

The Complexity Zoo has a pronunciation guide by Scott Aaronson "for those who insist on communicating verbally about complexity." It recommends the "p slash polly" option.

2

A refinement type is a type together with a decidable predicate: $$\{x:T ~|~ p(x)\}$$ where $x$ is a variable name, $T$ is a type, and $p(x)$ is a decidable predicate over $x$. A dependent pair type is the product type of two types where the second type depends on the value of the first: $$(x : T) \times q(x)$$ where $x$ is a variable name, $T$ is a type ...

1

This is rather surprising. If we look at the specification of the Hack Computer, I found this (consistent with your query): Instruction memory (ROM) Data memory: Memory (RAM) Also, I've been studying Computer Architecture- MIPS-64 bit by Hennessy, which is based on von Neumann's, like most of the general-purpose computers in the mainstream. Harvard machines ...

1

I had the same suspicion going through the Nand to Tetris course. Indeed, if you look at John K. Bennett's annotated version of "The Elements of Computing Systems", specifically Chapter 5, he calls this out: The Hack architecture would more properly be called a “Harvard Architecture,” since the data and instruction memories are separate. We can ...

Only top voted, non community-wiki answers of a minimum length are eligible